Surface Reconstruction by Voronoi Filtering
- Cite this article as:
- Amenta, N. & Bern, M. Discrete Comput Geom (1999) 22: 481. doi:10.1007/PL00009475
- 734 Downloads
We give a simple combinatorial algorithm that computes a piecewise-linear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled surfaces, where density depends on a local feature size function, the output is topologically valid and convergent (both pointwise and in surface normals) to the original surface. We briefly describe an implementation of the algorithm and show example outputs.