Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Ohrhallinger, Stefan"'
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, primari
Externí odkaz:
http://arxiv.org/abs/2404.09661
Autor:
Ohrhallinger, Stefan, Peethambaran, Jiju, Parakkat, Amal D., Dey, Tamal K., Muthuganapathy, Ramanathan
Curve reconstruction from unstructured points in a plane is a fundamental problem with many applications that has generated research interest for decades. Involved aspects like handling open, sharp, multiple and non-manifold outlines, run-time and pr
Externí odkaz:
http://arxiv.org/abs/2103.09583
Publikováno v:
Computer Vision -- ECCV 2020, 108--124
A key step in any scanning-based asset creation workflow is to convert unordered point clouds to a surface. Classical methods (e.g., Poisson reconstruction) start to degrade in the presence of noisy and partial scans. Hence, deep learning based metho
Externí odkaz:
http://arxiv.org/abs/2007.10453
Publikováno v:
Computer Aided Geometric Design Volume 79, May 2020, 101855
The design of functional seating furniture is a complicated process which often requires extensive manual design effort and empirical evaluation. We propose a computational design framework for pose-driven automated generation of body-supports which
Externí odkaz:
http://arxiv.org/abs/2003.10435
Autor:
Ohrhallinger, Stefan, Wimmer, Michael
We reconstruct a closed denoised curve from an unstructured and highly noisy 2D point cloud. Our proposed method uses a two- pass approach: Previously recovered manifold connectivity is used for ordering noisy samples along this manifold and express
Externí odkaz:
http://arxiv.org/abs/1808.07778
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ohrhallinger, Stefan
Given a point cloud, in the form of unorganized points, the problem of automatically connecting the dots to obtain an aesthetically pleasing and piecewise-linear closed interpolating boundary shape has been extensively researched for over three decad
Publikováno v:
Computer Graphics Forum. Oct2020, Vol. 39 Issue 7, p155-167. 13p. 4 Color Photographs, 1 Black and White Photograph, 4 Diagrams, 3 Charts, 2 Graphs.
Publikováno v:
In Computers & Graphics October 2013 37(6):645-658
We introduce a new method to compute the shape of an unstructured set of two-dimensional points. The algorithm exploits the to-date rarely used proximity-based graph called spheres-of-influence graph (SIG). We filter edges from the Delaunay triangula
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73be2d9ee2e8070d4a870c81b29196b7