Stefan Ohrhallinger

Orcid: 0000-0002-2526-7700

According to our database1, Stefan Ohrhallinger authored at least 21 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Reconstructing Curves from Sparse Samples on Riemannian Manifolds.
Comput. Graph. Forum, August, 2024

BallMerge: High-quality Fast Surface Reconstruction via Voronoi Balls.
Comput. Graph. Forum, May, 2024

Parameter-Free Connectivity for Point Clouds.
Proceedings of the 19th International Joint Conference on Computer Vision, 2024

SING: Stability-Incorporated Neighborhood Graph.
Proceedings of the SIGGRAPH Asia 2024 Conference Papers, 2024

2023
Parameter-Free and Improved Connectivity for Point Clouds.
Proceedings of the 44th Annual Conference of the European Association for Computer Graphics, 2023

2022
SIGDT: 2D Curve Reconstruction.
Comput. Graph. Forum, October, 2022

2021
Fast occlusion-based point cloud exploration.
Vis. Comput., 2021

2D Points Curve Reconstruction Survey and Benchmark.
Comput. Graph. Forum, 2021

2020
Points2Surf: Learning Implicit Surfaces from Point Cloud Patches.
CoRR, 2020

Fast Out-of-Core Octree Generation for Massive Point Clouds.
Comput. Graph. Forum, 2020

Pose to Seat: Automated design of body-supporting surfaces.
Comput. Aided Geom. Des., 2020

Points2Surf Learning Implicit Surfaces from Point Clouds.
Proceedings of the Computer Vision - ECCV 2020, 2020

2019
FitConnect: Connecting Noisy 2D Samples by Fitted Neighbourhoods.
Comput. Graph. Forum, 2019

2018
StretchDenoise: Parametric Curve Reconstruction with Guarantees by Separating Connectivity from Residual Uncertainty of Samples.
Proceedings of the 26th Pacific Conference on Computer Graphics and Applications, 2018

2017
Cut and Paint: Occlusion-Aware Subset Selection for Surface Processing.
Proceedings of the 43rd Graphics Interface Conference 2017, 2017

2016
Curve Reconstruction with Many Fewer Samples.
Comput. Graph. Forum, 2016

2014
Efficient collision detection while rendering dynamic point clouds.
Proceedings of the Graphics Interface 2014, 2014

2013
An Efficient Algorithm for Determining an Aesthetic Shape Connecting Unorganized 2D Points.
Comput. Graph. Forum, 2013

Minimizing edge length to connect sparsely sampled unstructured point sets.
Comput. Graph., 2013

2012
Minimising Longest Edge for Closed Surface Construction from Unorganised 3D Point Sets.
Proceedings of the 33rd Annual Conference of the European Association for Computer Graphics, 2012

2011
Interpolating an unorganized 2D point cloud with a single closed shape.
Comput. Aided Des., 2011


  Loading...