Answers are grounded in this paper and cite their sources.
The problem of computing a piecewise linear approximation to a surface from a set of sample points is important in solid modeling, computer graphics and computer vision. A recent algorithm 1 using the Voronoi diagram of the sample points gave a guarantee on the distance of the output surface from the original sampled surface assuming that the sample was sufficiently dense. We give a similar algorithm, simplifying the computation and the proof of the geometric guarantee. In addition, we guarantee that our output surface is homeomorphic to the original surface; to our knowledge this is the first such topological guarantee for this problem.
No takes yet. Share an insight, caveat, or question.
Amenta et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: