By Topic

Simple and efficient algorithm for part decomposition of 3-D triangulated models based on curvature analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Zhang, Y. ; Dept. of Electr. & Comput. Eng., Tennessee Univ., Knoxville, TN, USA ; Paik, J. ; Koschan, A. ; Abidi, M.A.
more authors

This paper presents a simple and efficient algorithm for part decomposition of compound objects based on Gaussian curvature analysis. The proposed algorithm consists of three major steps, Gaussian curvature estimation, boundary detection, and region growing. Boundaries between two articulated parts are composed of points with highly negative curvature based on the transversality regularity. These boundaries are therefore detected by thresholding estimated Gaussian curvatures for each vertex. A component labeling operation is then performed to grow non-boundary vertices into parts. The original contributions of this paper include: (i) novel, curvature analysis-based decomposition of 3-D models represented by triangle meshes into functional parts instead of surfaces and (ii) large mesh (over 100,000 triangles) handling capability with low computational cost and easy implementation. Experiments were conducted on a large number of both synthetic and real 3-D models. Experimental results demonstrated the performance and efficiency of the proposed algorithm.

Published in:

Image Processing. 2002. Proceedings. 2002 International Conference on  (Volume:3 )

Date of Conference:

24-28 June 2002