Bipartite Polar Classification for Surface Reconstruction

In this paper, we propose bipartite polar classification to augment an input unorganized point set ℘ with two disjoint groups of points distributed around the ambient space of ℘ to assist the task of surface reconstruction. The goal of bipartite polar classification is to obtain a space partitioning of ℘ by assigning pairs of Voronoi poles into two mutually invisible sets lying in the opposite sides of ℘ through direct point set visibility examination. Based on the observation that a pair of Voronoi poles are mutually invisible, spatial classification is accomplished by carving away visible exterior poles with their counterparts simultaneously determined as interior ones. By examining the conflicts of mutual invisibility, holes or boundaries can also be effectively detected, resulting in a hole‐aware space carving technique. With the classified poles, the task of surface reconstruction can be facilitated by more robust surface normal estimation with global consistent orientation and off‐surface point specification for variational implicit surface reconstruction. We demonstrate the ability of the bipartite polar classification to achieve robust and efficient space carving on unorganized point clouds with holes and complex topology and show its application to surface reconstruction.

[1]  A. Laurentini,et al.  The Visual Hull Concept for Silhouette-Based Image Understanding , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2003, ACM Trans. Graph..

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

[4]  Gil Shklarski,et al.  Interactive topology-aware surface reconstruction , 2007, ACM Trans. Graph..

[5]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[6]  Daniel Cohen-Or,et al.  Cone carving for surface reconstruction , 2010, ACM Trans. Graph..

[7]  Greg Turk,et al.  Interior/exterior classification of polygonal models , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[8]  Daniel Cohen-Or,et al.  Consolidation of unorganized point clouds for surface reconstruction , 2009, ACM Trans. Graph..

[9]  Joachim Giesen,et al.  Delaunay Triangulation Based Surface Reconstruction , 2006 .

[10]  Szymon Rusinkiewicz,et al.  Efficiently combining positions and normals for precise 3D geometry , 2005, ACM Trans. Graph..

[11]  Tamal K. Dey,et al.  Tight cocone: a water-tight surface reconstructor , 2003, SM '03.

[12]  Greg Turk,et al.  Interior/exterior classification of polygonal models , 2000 .

[13]  Pierre Alliez,et al.  Eurographics Symposium on Geometry Processing (2007) Voronoi-based Variational Reconstruction of Unoriented Point Sets , 2022 .

[14]  Markus H. Gross,et al.  Algebraic point set surfaces , 2007, ACM Trans. Graph..

[15]  Marc Levoy,et al.  A volumetric method for building complex models from range images , 1996, SIGGRAPH.

[16]  Shang-Hong Lai,et al.  Binary Orientation Trees for Volume and Surface Reconstruction from Unoriented Point Clouds , 2010, Comput. Graph. Forum.

[17]  Jirí Bittner,et al.  Visibility-driven Mesh Analysis and Visualization through Graph Cuts , 2008, IEEE Transactions on Visualization and Computer Graphics.

[18]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

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

[20]  James F. O'Brien,et al.  Modelling with implicit surfaces that interpolate , 2002, TOGS.

[21]  Richard K. Beatson,et al.  Reconstruction and representation of 3D objects with radial basis functions , 2001, SIGGRAPH.

[22]  R. Basri,et al.  Direct visibility of point sets , 2007, SIGGRAPH 2007.

[23]  Niloy J. Mitra,et al.  Visibility of noisy point cloud data , 2010, Comput. Graph..

[24]  Pierre Alliez,et al.  Signing the Unsigned: Robust Surface Reconstruction from Raw Pointsets , 2010, Comput. Graph. Forum.

[25]  J. Giesen,et al.  Delaunay Triangulation Based Surface Reconstruction: Ideas and Algorithms , 2004 .

[26]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2005, SIGGRAPH Courses.

[27]  Shang-Hong Lai,et al.  Contour-Based Structure from Reflection , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[28]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1992, VVS.

[29]  Martin Z. Bazant,et al.  Multiscale modeling in granular flow , 2007 .

[30]  Michael M. Kazhdan,et al.  Poisson surface reconstruction , 2006, SGP '06.