Abstract.
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received August 25, 1998, and in revised form March 31, 1999.
Rights and permissions
About this article
Cite this article
Amenta, N., Bern, M. Surface Reconstruction by Voronoi Filtering . Discrete Comput Geom 22, 481–504 (1999). https://doi.org/10.1007/PL00009475
Issue Date:
DOI: https://doi.org/10.1007/PL00009475