Consistent mesh partitioning and skeletonisation using the shape diameter function

Mesh partitioning and skeletonisation are fundamental for many computer graphics and animation techniques. Because of the close link between an object’s skeleton and its boundary, these two problems are in many cases complementary. Any partitioning of the object can assist in the creation of a skeleton and any segmentation of the skeleton can infer a partitioning of the object. In this paper, we consider these two problems on a wide variety of meshes, and strive to construct partitioning and skeletons which remain consistent across a family of objects, not a single one. Such families can consist of either a single object in multiple poses and resolutions, or multiple objects which have a general common shape. To achieve consistency, we base our algorithms on a volume-based shape-function called the shape-diameter-function (SDF), which remains largely oblivious to pose changes of the same object and maintains similar values in analogue parts of different objects. The SDF is a scalar function defined on the mesh surface; however, it expresses a measure of the diameter of the object’s volume in the neighborhood of each point on the surface. Using the SDF we are able to process and manipulate families of objects which contain similarities using a simple and consistent algorithm: consistently partitioning and creating skeletons among multiple meshes.

[1]  Ariel Shamir,et al.  Segmentation and Shape Extraction of 3D Boundary Meshes , 2006, Eurographics.

[2]  Hao Zhang,et al.  Segmentation of 3D meshes through spectral clustering , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[3]  Leonidas J. Guibas,et al.  Shape segmentation using local slippage analysis , 2004, SGP '04.

[4]  Ross T. Whitaker,et al.  Partitioning 3D Surface Meshes Using Watershed Segmentation , 1999, IEEE Trans. Vis. Comput. Graph..

[5]  Nancy M. Amato,et al.  Approximate convex decomposition of polygons , 2004, SCG '04.

[6]  J. Tierny,et al.  3D Mesh Skeleton Extraction Using Topological and Geometrical Analyses , 2006 .

[7]  Nancy M. Amato,et al.  Simultaneous shape decomposition and skeletonization , 2006, SPM '06.

[8]  Anne Verroust-Blondet,et al.  Extracting skeletal curves from 3D scattered data , 1999, Proceedings Shape Modeling International '99. International Conference on Shape Modeling and Applications.

[9]  Ayellet Tal,et al.  Hierarchical mesh decomposition using fuzzy clustering and cuts , 2003, ACM Trans. Graph..

[10]  Giuseppe Patanè,et al.  Shape-Covering for Skeleton Extraction , 2002, Int. J. Shape Model..

[11]  David Levin,et al.  The approximation power of moving least-squares , 1998, Math. Comput..

[12]  Ayellet Tal,et al.  Mesh segmentation using feature point and core extraction , 2005, The Visual Computer.

[13]  R. Zabih,et al.  Spatially coherent clustering using graph cuts , 2004, CVPR 2004.

[14]  Daniel Cohen-Or,et al.  Intelligent mesh scissoring using 3D snakes , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[15]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

[16]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

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

[18]  Tamal K. Dey,et al.  Shape Segmentation and Matching with Flow Discretization , 2003, WADS.

[19]  Wan-Chun Ma,et al.  Domain connected graph: the skeleton of a closed 3D shape for animation , 2006, The Visual Computer.

[20]  Gabriella Sanniti di Baja,et al.  Using distance transforms to decompose 3D discrete objects , 2002, Image Vis. Comput..

[21]  M. Spagnuolo,et al.  Shape understanding by contour-driven retiling , 2003, The Visual Computer.

[22]  Trevor F. Cox,et al.  Metric multidimensional scaling , 2000 .

[23]  Tamal K. Dey,et al.  Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee , 2003, Algorithmica.

[24]  Michael Garland,et al.  Fair morse functions for extracting the topological structure of a surface mesh , 2004, ACM Trans. Graph..

[25]  Marco Attene,et al.  Hierarchical mesh segmentation based on fitting primitives , 2006, The Visual Computer.

[26]  Ayellet Tal,et al.  Polyhedral surface decomposition with applications , 2002, Comput. Graph..

[27]  In-Kwon Lee,et al.  Curve reconstruction from unorganized points , 2000, Comput. Aided Geom. Des..

[28]  Sanjoy Dasgupta,et al.  Learning mixtures of Gaussians , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

[30]  Nikos A. Vlassis,et al.  A Greedy EM Algorithm for Gaussian Mixture Learning , 2002, Neural Processing Letters.

[31]  Jarek Rossignac,et al.  Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes , 2003, Algorithmica.

[32]  Ayellet Tal,et al.  Metamorphosis of Polyhedral Surfaces using Decomposition , 2002, Comput. Graph. Forum.

[33]  Mongi A. Abidi,et al.  Perception-based 3D triangle mesh segmentation using fast marching watersheds , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[34]  Alan L. Yuille,et al.  FORMS: A flexible object recognition and modelling system , 1996, International Journal of Computer Vision.

[35]  Mohamed Daoudi,et al.  Topology driven 3D mesh hierarchical segmentation , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).