Abstract
We introduce a robust and feature-capturing surface reconstruction and simplification method that turns an input point set into a low triangle-count simplicial complex. Our approach starts with a (possibly non-manifold) simplicial complex filtered from a 3D Delaunay triangulation of the input points. This initial approximation is iteratively simplified based on an error metric that measures, through optimal transport, the distance between the input points and the current simplicial complex-both seen as mass distributions. Our approach is shown to exhibit both robustness to noise and outliers, as well as preservation of sharp features and boundaries. Our new feature-sensitive metric between point sets and triangle meshes can also be used as a postprocessing tool that, from the smooth output of a reconstruction method, recovers sharp features and boundaries present in the initial point set.
| Original language | English |
|---|---|
| Pages (from-to) | 369-382 |
| Number of pages | 14 |
| Journal | Journal of Mathematical Imaging and Vision |
| Volume | 48 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Feb 2014 |
| Externally published | Yes |
Keywords
- Feature recovery
- Linear programming
- Optimal transportation
- Shape simplification
- Surface reconstruction
- Wasserstein distance
Fingerprint
Dive into the research topics of 'Feature-preserving surface reconstruction and simplification from defect-laden point sets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver