Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A SIMPLE AND EFFICIENT ALGORITHM FOR PART DECOMPOSITION OF 3-D TRIANGULATED MODELS BASED ON CURVATURE ANALYSIS
 

Summary: A SIMPLE AND EFFICIENT ALGORITHM FOR PART DECOMPOSITION OF 3-D
TRIANGULATED MODELS BASED ON CURVATURE ANALYSIS
Y. Zhang, J. Paik, A. Koschan, and M. A. Abidi
Dept. of Electrical & Computer Engineering
The University of Tennessee
Knoxville, TN 37996-2100
D. Gorsich
U. S. Army TACOM
National Automotive Center
Warren, Michigan 48397-5000
ABSTRACT
This paper presents a simple and efficient algorithm for
part decomposition of compound objects based on Gaus-
sian curvature analysis. The proposed algorithm consists
of three major steps, Gaussian curvature estimation, bound-
ary detection, and region growing. Boundaries between two
articulated parts are composed of points with highly nega-
tive curvature based on the transversality regularity. These
boundaries are therefore detected by thresholding estimated
Gaussian curvatures for each vertex. A component label-

  

Source: Abidi, Mongi A. - Department of Electrical and Computer Engineering, University of Tennessee

 

Collections: Computer Technologies and Information Sciences