Provably good moving least squares

  • Authors:
  • Ravikrishna Kolluri

  • Affiliations:
  • University of California, Berkeley, Berkeley, CA

  • Venue:
  • SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.