An efficient and robust algorithm for 3D mesh segmentation

被引:35
作者
Chen, Lijun [1 ]
Georganas, Nicolas D. [1 ]
机构
[1] Univ Ottawa, Sch Informat Technol & Engn, Ottawa, ON K1N 6N5, Canada
关键词
3D mesh; Gaussian curvature; concaveness; XMR neighborhood; watershed algorithm; region merging;
D O I
10.1007/s11042-006-0002-x
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents an efficient and robust algorithm for 3D mesh segmentation. Segmentation is one of the main areas of 3D object modeling. Most segmentation methods decompose 3D objects into parts based on curvature analysis. Most of the existing curvature estimation algorithms are computationally costly. The proposed algorithm extracts features using Gaussian curvature and concaveness estimation to partition a 3D model into meaningful parts. More importantly, this algorithm can process highly detailed objects using an eXtended Multi-Ring (XMR) neighborhood based feature extraction. After feature extraction, we also developed a fast marching watershed-based segmentation algorithm followed by an efficient region merging scheme. Experimental results show that this segmentation algorithm is efficient and robust.
引用
收藏
页码:109 / 125
页数:17
相关论文
共 21 条
[1]  
[Anonymous], 1977, ELEMENTS DIFFERENTIA
[2]  
Barr A. H., 1981, IEEE Computer Graphics and Applications, V1, P11, DOI 10.1109/MCG.1981.1673799
[3]  
Beucher S., 1979, INT WORKSHOP IMAGE P
[4]  
Chen LJ, 2002, HAVE 2002 - IEEE INTERNATIONAL WORKSHOP ON HAPTIC VIRTUAL ENVIRONMENTS AND THEIR APPLICATIONS, P49, DOI 10.1109/HAVE.2002.1106913
[5]  
Chevalier Laurent, 2003, J WSCG, V11, P4
[6]  
Garland M, 2001, P ACM S INT 3D GRAPH, P49, DOI DOI 10.1145/364338.364345
[7]  
GRAY A, 1993, GAUSSIAN MEAN CURVAT, P279
[8]  
HOPPE H, 1996, SIGGRAPH 96, P99, DOI DOI 10.1145/237170.237216
[9]  
Isler V., 1996, VRST'96. Proceedings of the ACM Symposium on Virtual Reality and Technology, P11
[10]   Superquadrics for segmenting and modeling range data [J].
Leonardis, A ;
Jaklic, A ;
Solina, F .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (11) :1289-1295