Stefan Ohrhallinger

Stefan Ohrhallinger

Auto-generated profile, based on publicly available information

Stefan Ohrhallinger

TU Wien Vienna Austria

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 October 2020
Verified
Book Chapter
Closed access
PDF file
PEPhilipp Erler
Philipp Erler
PGPaul Guerrero
Paul Guerrero
SOStefan Ohrhallinger
Stefan Ohrhallinger
NMNiloy J. Mitra
Niloy J. Mitra
MWMichael Wimmer
Michael Wimmer

5 July 2013 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
SOS. Ohrhallinger
S. Ohrhallinger
SMS. Mudur
S. Mudur

11 May 2018 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
SOS. Ohrhallinger
S. Ohrhallinger
MWMichael Wimmer
Michael Wimmer

1 October 2022 in Computer Graphics Forum
Verified
Journal Article
Open access
DMD. Marin
D. Marin
SOS. Ohrhallinger
S. Ohrhallinger
MWMichael Wimmer
Michael Wimmer
Determining connectivity between points and reconstructing their shape boundaries are long‐standing problems in computer graphics. One possible approach to solve these problems is to use a proximity graph. We propose a new proximity graph computed by intersecting the to‐date rarely used proximity‐based graph called spheres‐of‐influence graph (SIG) with the Delaunay triangulation (DT). We prove that the resulting graph, which we name SIGDT, contains the piece‐wise linear reconstruction for a set of unstructured points in the plane for a sampling condition superseding current bounds and capturing well practical point sets' properties. As an application, we apply a dual of boundary adjustment steps from the Connect2D algorithm to remove the redundant edges. We show that the resulting algorithm SIG‐Connect2D yields the best reconstruction accuracy compared to state‐of‐the‐art algorithms from a recent comprehensive benchmark, and the method offers the potential for further improvements, e.g., for surface reconstruction.

31 July 2024 in Computer Graphics Forum
Verified
Journal Article
Open access
DMD. Marin
D. Marin
FMF. Maggioli
F. Maggioli
SMS. Melzi
S. Melzi
SOS. Ohrhallinger
S. Ohrhallinger
MWMichael Wimmer
Michael Wimmer
Reconstructing 2D curves from sample points has long been a critical challenge in computer graphics, finding essential applications in vector graphics. The design and editing of curves on surfaces has only recently begun to receive attention, primarily relying on human assistance, and where not, limited by very strict sampling conditions. In this work, we formally improve on the state‐of‐the‐art requirements and introduce an innovative algorithm capable of reconstructing closed curves directly on surfaces from a given sparse set of sample points. We extend and adapt a state‐of‐the‐art planar curve reconstruction method to the realm of surfaces while dealing with the challenges arising from working on non‐Euclidean domains. We demonstrate the robustness of our method by reconstructing multiple curves on various surface meshes. We explore novel potential applications of our approach, allowing for automated reconstruction of curves on Riemannian manifolds.

25 November 2020
Verified
Book Chapter
Closed access
PDF file
MRMohamed Radwan
Mohamed Radwan
SOStefan Ohrhallinger
Stefan Ohrhallinger
MWMichael Wimmer
Michael Wimmer
A recent trend in interactive environments is the use of unstructured and temporally varying point clouds. This is driven by both affordable depth cameras and augmented reality simulations. One research question is how to perform collision detection on such point clouds. State-of-the-art methods for collision detection create a spatial hierarchy in order to capture dynamic point cloud surfaces, but they require O(NlogN) time for N points. We propose a novel screen-space representation for point clouds which exploits the property of the underlying surface being 2D. In order for dimensionality reduction, a 3D point cloud is converted into a series of thickened layered depth images. This data structure can be constructed in O(N) time and allows for fast surface queries due to its increased compactness and memory coherency. On top of that, parts of its construction come for free since they are already handled by the rendering pipeline. As an application we demonstrate online collision detection between dynamic point clouds. It shows superior accuracy when compared to other methods and robustness to sensor noise since uncertainty is hidden by the thickened boundary.