期刊名称：International Journal of Signal Processing, Image Processing and Pattern Recognition
印刷版ISSN：2005-4254
出版年度：2016
卷号：9
期号：1
页码：265-274
DOI：10.14257/ijsip.2016.9.1.25
出版社：SERSC
摘要：The discrete curvature is sensitive to the noise and heavy computation of feature value. In order to extract the segmentation lines of 3D meshes, this paper presents a novel and efficient algorithm which is based on regional discrete curvature. Extract prominent feature points, pre-segmentation and then obtain the constraint region. Calculate the curvature degree extremal points within the constraint region, finally utilize the curvature degree extremal points to fit plane which guaid extracting the segmentation lines. This algorithm does not need to wipe off the noise at initial stage, the experiment results show that the proposed algorithm can accurately and frequently yield meaningful segmentation lines for models which has an evident branch structure.
