Help Privacy Policy Disclaimer
  Advanced SearchBrowse





Graph-based Conservative Surface Reconstruction


Dumitriu,  Daniel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;
International Max Planck Research School, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Dumitriu, D. (2007). Graph-based Conservative Surface Reconstruction. Master Thesis, Universität des Saarlandes, Saarbrücken.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1DAA-B
We propose a new approach for reconstructing a 2-manifold from a point sample in R³. Compared to previous algorithms, our approach is novel in that it throws away geometry information early on in the reconstruction process and mainly operates combinatorially on a graph structure. Furthermore, it is very conservative in creating adjacencies between samples in the vicinity of slivers, still we can prove that the resulting reconstruction faithfully resembles the original 2-manifold. While the theoretical proof requires an extremely high sampling density, our prototype implementation of the approach produces surprisingly good results on typical sample sets.