Partitioning 3D Surface Meshes Using Watershed Segmentation

This paper describes a method for partitioning 3D surface meshes into useful segments. The proposed method generalizes morphological watersheds, an image segmentation technique, to 3D surfaces. This surface segmentation uses the total curvature of the surface as an indication of region boundaries. The surface is segmented into patches, where each patch has a relatively consistent curvature throughout, and is bounded by areas of higher, or drastically different, curvature. This algorithm has applications for a variety of important problems in visualization and geometrical modeling including 3D feature extraction, mesh reduction, texture mapping 3D surfaces, and computer aided design.

[1]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[2]  Bernard Chazelle,et al.  Triangulating a nonconvex polytope , 1990, Discret. Comput. Geom..

[3]  T WhitakerRoss.  A Level-Set Approach to 3D Reconstruction from Range Data , 1998 .

[4]  A. C. F. Colchester,et al.  Network Representation of 2-D and 3-D Images , 1990 .

[5]  Olivier D. Faugeras,et al.  A 3-D Recognition and Positioning Algorithm Using Geometrical Matching Between Primitive Surfaces , 1983, IJCAI.

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

[7]  Chandrajit L. Bajaj,et al.  Convex Decomposition of Polyhedra and Robustness , 1992, SIAM J. Comput..

[8]  Jan J. Koenderink,et al.  Local features of smooth shapes: ridges and courses , 1993, Optics & Photonics.

[9]  Glynn P. Robinson,et al.  Scale and segmentation of grey-level images using maximum gradient paths , 1991, Image Vis. Comput..

[10]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

[11]  Bernard Chazelle,et al.  Strategies for polyhedral surface decomposition: an experimental study , 1995, SCG '95.

[12]  Bernard Chazelle,et al.  Triangulating a non-convex polytype , 1989, SCG '89.

[13]  Robert B. Fisher,et al.  Experiments in Curvature-Based Segmentation of Range Data , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  David H. Eberly,et al.  Ridges in Image and Data Analysis , 1996, Computational Imaging and Vision.

[15]  Glynn P. Robinson,et al.  Scale and segmentation of grey-level images using maximum gradient paths , 1991, Image and Vision Computing.

[16]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[17]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[18]  Mongi A. Abidi,et al.  Fixed-Rate Interactivity for Visualization of Photo-Realistic Multiresolution Models , 1999 .

[19]  J. Sethian.  Level set methods : evolving interfaces in geometry, fluid mechanics, computer vision, and materials science , 1996 .

[20]  Christopher S. Gourley,et al.  Pattern Vector Based Reduction Of Large Multimodal Data Sets For Fixed Rate Interactivity During Vis , 1998 .

[21]  Jan J. Koenderink,et al.  Solid shape , 1990 .

[22]  Andrew W. Fitzgibbon,et al.  Extracting surface patches from complete range descriptions , 1997, Proceedings. International Conference on Recent Advances in 3-D Digital Imaging and Modeling (Cat. No.97TB100134).

[23]  R. Lee,et al.  Two-Dimensional Critical Point Configuration Graphs , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Paul J. Besl,et al.  Surfaces in Range Image Understanding , 1988, Springer Series in Perception Engineering.