We give a simple combinatorial algorithm that computes a piecewise-linear a
pproximation of a smooth surface from a finite set of sample points. The al
gorithm uses Voronoi vertices to remove triangles from the Delaunay triangu
lation. We prove the algorithm correct by showing that for densely sampled
surfaces, where density depends on a local feature size function, the outpu
t is topologically valid and convergent (both pointwise and in surface norm
als) to the original surface. We briefly describe an implementation of the
algorithm and show example outputs.