A fast and efficient mesh segmentation method based on improved region growing

Mesh segmentation is one of the important issues in digital geometry processing. Region growing method has been proven to be a efficient method for 3D mesh segmentation. However, in mesh segmentation, feature line extraction algorithm is computationally costly, and the over-segmentation problem stil...

Full description

Saved in:
Bibliographic Details
Published in:Applied Mathematics-A Journal of Chinese Universities 2014-12, Vol.29 (4), p.468-480
Main Authors: Yang, Fei, Zhou, Fan, Wang, Ruo-mei, Liu, Li, Luo, Xiao-nan
Format: Article
Language:English
Subjects:
Applications of Mathematics
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Mesh segmentation is one of the important issues in digital geometry processing. Region growing method has been proven to be a efficient method for 3D mesh segmentation. However, in mesh segmentation, feature line extraction algorithm is computationally costly, and the over-segmentation problem still exists during region merging processing. In order to tackle these problems, a fast and efficient mesh segmentation method based on improved region growing is proposed in this paper. Firstly, the dihedral angle of each non-boundary edge is defined and computed simply, then the sharp edges are detected and feature lines are extracted. After region growing process is finished, an improved region merging method will be performed in two steps by considering some geometric criteria. The experiment results show the feature line extraction algorithm can obtain the same geometric information fast with less computational costs and the improved region merging method can solve over-segmentation well.
ISSN:1005-1031
1993-0445
DOI:10.1007/s11766-014-3240-0