Key points are not available for this paper at this time.
We analyze a moving least squares algorithm for reconstructing a surface from point cloud data. Our algorithm defines an implicit function I whose zero set U is the reconstructed surface. We prove that I is a good approximation to the signed distance function of the sampled surface F and that U is geometrically close to and homeomorphic to F. Our proof requires sampling conditions similar to e-sampling, used in Delaunay reconstruction algorithms.
Ravikrishna Kolluri (Sun,) studied this question.