Shape segmentation using local slippage analysis

We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or more slippable motions: rigid motions which, when applied to a shape, slide the transformed version against the stationary version without forming any gaps. Slippable shapes include rotationally and translationally symmetrical shapes such as planes, spheres, and cylinders, which are often found as components of scanned mechanical parts. We show how to determine the slippable motions of a given shape by computing eigenvalues of a certain symmetric matrix derived from the points and normals of the shape. Our algorithm then discovers slippable components in the input data by computing local slippage signatures at a set of points of the input and iteratively aggregating regions with matching slippable motions. We demonstrate the performance of our algorithm for reverse engineering surfaces of mechanical parts.

[1]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2]  Bruno Lévy,et al.  Least squares conformal maps for automatic texture atlas generation , 2002, ACM Trans. Graph..

[3]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  Marc Alexa,et al.  Linear combination of transformations , 2002, ACM Trans. Graph..

[5]  Leonidas J. Guibas,et al.  Estimating surface normals in noisy point cloud data , 2004, Int. J. Comput. Geom. Appl..

[6]  Marc Levoy,et al.  Efficient variants of the ICP algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

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

[8]  Pedro V. Sander,et al.  Texture mapping progressive meshes , 2001, SIGGRAPH.

[9]  Frank Chongwoo Park,et al.  Smooth invariant interpolation of rotations , 1997, TOGS.

[10]  Gérard G. Medioni,et al.  Object modelling by registration of multiple range images , 1992, Image Vis. Comput..

[11]  Johannes Wallner,et al.  Line Geometry for 3D Shape Understanding and Reconstruction , 2004, ECCV.

[12]  Ioana M. Boier-Martin.  Domain Decomposition for Multiresolution Analysis , 2003, Symposium on Geometry Processing.

[13]  Ralph R. Martin,et al.  Algorithms for reverse engineering boundary representation models , 2001, Comput. Aided Des..

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

[15]  H. Pottmann,et al.  Computational Line Geometry , 2001 .

[16]  Marc Levoy,et al.  Fitting smooth surfaces to dense polygon meshes , 1996, SIGGRAPH.

[17]  V. Srinivasan.  Theory of Dimensioning: An Introduction to Parameterizing Geometric Models , 2003 .

[18]  Marc Levoy,et al.  Geometrically stable sampling for the ICP algorithm , 2003, Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings..

[19]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Ralph R. Martin,et al.  Reverse engineering of geometric models - an introduction , 1997, Comput. Aided Des..

[21]  Gérard G. Medioni,et al.  Object modeling by registration of multiple range images , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[22]  Paul J. Besl,et al.  Direct construction of polynomial surfaces from dense range images through region growing , 1995, TOGS.

[23]  Michael Garland,et al.  Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.