A sampling theorem for MLS surfaces

Recently, point set surfaces has been the focus of a large number of research efforts. Several different methods have been proposed to define surfaces from points and have been used in a variety of applications. However, so far little is know about the mathematical properties of the resulting surface. A central assumption for most algorithms is that the surface construction is well defined within a neighborhood of the samples. However, it is not clear that given an irregular sampling of a surface this is the case. The fundamental problem is that point based methods often use a weighted least squares fit of a plane to approximate a surface normal. If this minimization problem is ill-defined so is the surface construction. In this paper, we provide a proof that given reasonable sampling conditions the normal approximations are well defined within a neighborhood of the samples. Similar to methods in surface reconstruction, our sampling conditions are based on the local feature size and thus allow the sampling density to vary according to geometric complexity.

[1]  Niloy J. Mitra,et al.  Estimating surface normals in noisy point cloud data , 2003, SCG '03.

[2]  D. Levin,et al.  Mesh-Independent Surface Interpolation , 2004 .

[3]  Ravi Krishna Kolluri,et al.  Provably good moving least squares , 2005, SIGGRAPH Courses.

[4]  Nina Amenta,et al.  Defining point-set surfaces , 2004, ACM Trans. Graph..

[5]  T. Dey,et al.  Extremal Surface Based Projections Converge and Reconstruct with Isotopy , 2005 .

[6]  Marc Alexa,et al.  Point based animation of elastic, plastic and melting objects , 2004, SCA '04.

[7]  Tamal K. Dey,et al.  Provable surface reconstruction from noisy samples , 2004, SCG '04.

[8]  Marc Alexa,et al.  Computing and Rendering Point Set Surfaces , 2003, IEEE Trans. Vis. Comput. Graph..

[9]  Marc Alexa,et al.  Approximating and Intersecting Surfaces from Points , 2003, Symposium on Geometry Processing.

[10]  Marshall W. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

[11]  Sunghee Choi,et al.  A simple algorithm for homeomorphic surface reconstruction , 2000, SCG '00.

[12]  Sunghee Choi,et al.  The power crust , 2001, SMA '01.

[13]  Tamal K. Dey,et al.  An Adaptive MLS Surface for Reconstruction with Guarantees , 2022 .

[14]  Sunghee Choi,et al.  A Simple Algorithm for Homeomorphic Surface Reconstruction , 2002, Int. J. Comput. Geom. Appl..

[15]  Markus H. Gross,et al.  Shape modeling with point-sampled geometry , 2003, ACM Trans. Graph..

[16]  N. Amenta,et al.  Defining point-set surfaces , 2004, SIGGRAPH 2004.

[17]  Marshall W. Bern,et al.  A new Voronoi-based surface reconstruction algorithm , 1998, SIGGRAPH.

[18]  Matthias Zwicker,et al.  Pointshop 3D: an interactive system for point-based surface editing , 2002, SIGGRAPH.

[19]  Tamal K. Dey,et al.  Provable surface reconstruction from noisy samples , 2006, Comput. Geom..