Provably Good Surface Sampling and Approximation

We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds points on S and updates the 3-dimensional Delaunay triangulation of the points. The method is very simple and works in 3d-space without requiring to parameterize the surface. Taking advantage of recent results on the restricted Delaunay triangulation, we prove that the algorithm can generate good samples on S as well as triangulated surfaces that approximate S. More precisely, we show that the restricted Delaunay triangulation Del S of the points has the same topology type as S, that the Hausdorff distance between Del S and S can be made arbitrarily small, and that we can bound the aspect ratio of the facets of Del S. The algorithm has been implemented and we report on experimental results that provide evidence that it is very effective in practice. We present results on implicit surfaces, on CSG models and on...

• Type: Conference
• Year: 2003
• Where: SGP
• Authors: Steve Oudot, Jean-Daniel Boissonnat
• Keywords: 3-dimensional Delaunay Triangulation, Computer Graphics, Delaunay Triangulation, SGP 2003, Surfaces