The power crust

The power crust is a construction which takes a sample of points from the surface of a three-dimensional object and produces a surface mesh and an approximate medial axis. The approach is to first approximate the medial axis transform (MAT) of the object. We then use an inverse transform to produce the surface representation from the MAT. This idea leads to a simple algorithm with theoretical guarantees comparable to those of other surface reconstruction and medial axis approximation algorithms. It also comes with a guarantee that does not depend in any way on the quality of the input point sample. Any input gives an output surface which is the `watertight' boundary of a three-dimensional polyhedral solid: the solid described by the approximate MAT. This unconditional guarantee makes the algorithm quite robust and eliminates the polygonalization, hole-filling or manifold extraction post-processing steps required in previous surface reconstruction algorithms. In this paper, we use the theory to develop a power crust implementation which is indeed robust for realistic and even difficult samples. We describe the careful design of a key subroutine which labels parts of the MAT as inside or outside of the object, easy in theory but non-trivial in practice. We find that we can handle areas in which the input sampling is scanty or noisy by simply discarding the unreliable parts of the MAT approximation. We demonstrate good empirical results on inputs including models with sharp corners, sparse and unevenly distributed point samples, holes, and noise, both natural and synthetic. We also demonstrate some simple extensions: intentionally leaving holes where there is no data, producing approximate offset surfaces, and simplifying the approximate MAT in a principled way to preserve stable features.

[1]  Jean-Daniel Boissonnat,et al.  Geometric structures for three-dimensional shape representation , 1984, TOGS.

[2]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[3]  Hartmut Noltemeier Computational Geometry and its Applications , 1988 .

[4]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[5]  Christoph M. Hoffmann,et al.  How to Construct the Skeleton of CSG Objects , 1990 .

[6]  Leonard A. Ferrari,et al.  Curves and Surfaces in Computer Vision and Graphics , 1990 .

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

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

[9]  J. Brandt Describing a solid with the three-dimensional skeleton , 1992 .

[10]  Herbert Edelsbrunner,et al.  The union of balls and its dual shape , 1993, SCG '93.

[11]  Victor J. Milenkovic,et al.  Robust Construction of the Voronoi Diagram of a Polyhedron , 1993, CCCG.

[12]  Robert L. Ogniewicz,et al.  Skeleton-space: a multiscale shape description combining region and boundary information , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[13]  P. J. Vermeer Medial axis transform to boundary representation conversion , 1994 .

[14]  M. Overmars,et al.  Approximating generalized Voronoi diagrams in any dimension , 1995 .

[15]  Nicholas M. Patrikalakis,et al.  An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids , 1996, IEEE Trans. Vis. Comput. Graph..

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

[17]  Alain Fournier,et al.  Matching and Interpolation of Shapes using Unions of Circles , 1996, Comput. Graph. Forum.

[18]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[19]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[20]  Damian J. Sheehy,et al.  Shape Description By Medial Surface Construction , 1996, IEEE Trans. Vis. Comput. Graph..

[21]  Howie Choset,et al.  Sensor based motion planning: the hierarchical generalized Voronoi graph , 1996 .

[22]  Mark A. Ganter,et al.  Skeleton-based modeling operations on solids , 1997, SMA '97.

[23]  Hao Chen,et al.  An accelerated triangulation method for computing the skeletons of free-form solid models , 1997, Comput. Aided Des..

[24]  Hwan Pyo Moon,et al.  MATHEMATICAL THEORY OF MEDIAL AXIS TRANSFORM , 1997 .

[25]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[26]  Dominique Attali,et al.  Computing and Simplifying 2D and 3D Continuous Skeletons , 1997, Comput. Vis. Image Underst..

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

[28]  Seth J. Teller,et al.  Assisted articulation of closed polygonal models , 1998, SIGGRAPH '98.

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

[30]  Christopher M. Gold,et al.  Crust and anti-crust: a one-step boundary and skeleton extraction algorithm , 1999, SCG '99.

[31]  Ari Rappoport,et al.  Computing the Voronoi diagram of a 3-D polyhedron by separate computation of its symbolic and geometric parts , 1999, SMA '99.

[32]  Alla Sheffer,et al.  Hexahedral Mesh Generation using the Embedded Voronoi Graph , 1999, Engineering with Computers.

[33]  Mark A. Ganter,et al.  A skeletal-based solid editor , 1999, SMA '99.

[34]  Gabriel Taubin,et al.  The ball-pivoting algorithm for surface reconstruction , 1999, IEEE Transactions on Visualization and Computer Graphics.

[35]  Steven W. Zucker,et al.  On the evolution of the skeleton , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[36]  George D. Stetten,et al.  Automated Identification and Measurement of Objects via Populations of Medial Primitives, with Application to Real Time 3D Echocardiography , 1999, IPMI.

[37]  Nancy M. Amato,et al.  Motion planning for a rigid body using random networks on the medial axis of the free space , 1999, SCG '99.

[38]  Dinesh Manocha,et al.  Accurate computation of the medial axis of a polyhedron , 1999, SMA '99.

[39]  Leonidas J. Guibas,et al.  A probabilistic roadmap planner for flexible objects with a workspace medial-axis-based sampling approach , 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289).

[40]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[41]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

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

[43]  Jean-Daniel Boissonnat,et al.  Smooth surface reconstruction via natural neighbour interpolation of distance functions , 2000, SCG '00.

[44]  Holly E. Rushmeier,et al.  Strategies for registering range images from unknown camera positions , 2000, Electronic Imaging.

[45]  Sunghee Choi,et al.  The power crust, unions of balls, and the medial axis transform , 2001, Comput. Geom..

[46]  Jacques-Olivier Lachaud,et al.  Delaunay conforming iso-surface, skeleton extraction and noise removal , 2001, Comput. Geom..

[47]  Ari Rappoport,et al.  Computing Voronoi skeletons of a 3-D polyhedron by space subdivision , 2002, Comput. Geom..

[48]  Meenakshisundaram Gopi,et al.  A fast and efficient projection-based approach for surface reconstruction , 2002, Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing.