期刊文献+

A fast and efficient mesh segmentation method based on improved region growing 被引量:3

A fast and efficient mesh segmentation method based on improved region growing
下载PDF
导出
摘要 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. 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.
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2014年第4期468-480,共13页 高校应用数学学报(英文版)(B辑)
基金 Supported by the National Natural Science Foundation of China(61272192,61379112) the NSFC-Guang dong Joint Fund(U1135003)
关键词 mesh segmentation feature line region growing dihedral angle. mesh segmentation, feature line, region growing, dihedral angle.
  • 相关文献

参考文献31

  • 1M Attene, B Falcidieno, and M Spagnuolo. Hierarchical mesh segmentation based on fitting primitives, Visual Comput, 2006, 22: 181-193.
  • 2M Attene, S Katz, M Mortara, G Patane, M Spagnuolo, and A Tal. Mesh Segmentation-A Comparative Study, Proc IEEE Int Conf Shape Model Appl, 2006, 7-18.
  • 3L J Chen, N D Georganas. An efficient and robust algorithm for 3D mesh segmentation, Multi- media Tools Appl 29, 2006, 109-125.
  • 4X B Chen, A Golovinskiy, and T Funkhouser. A benchmark for 3D mesh segmentation, ACM Trans Graph 28, 2009, 73: 1-12.
  • 5D Cohen-Steiner, P Alliez, and M Desbrun. Variational shape approximation, ACM SIGGRAPH 2004 Papers, 2004, 905-914.
  • 6T Funkhouser, M Kazhdan, P Shilane, P Min, W Kiefer, A Tal, S Rusinkiewicz, and D Dobkin. Modeling by example, ACM SIGGRAPH 2004 Papers- 20041 652-663.
  • 7M Garland, P S Heckbert. Surface simplification using quadric error metrics, In: Proc 24th Ann Conf Comput Graph Interactive Tech, SIGGRAPH '97, 1997, 209-216.
  • 8M Garland, A Willmott, and P S Heckbert. Hierarchical face clustering on polygonal surfaces, In: Proc 2001 Syrup Interactive 3D Graph, I3D'01, 2001, 49-58.
  • 9A Golovinskiy, T Funkhouser. Randomized cuts for 3d mesh analysis, ACM Trans Graph 27, 2008, 145: 1-12.
  • 10H Qian, B Dom. Quantitative methods of evaluating image segmentation, In: Image Process, 1995. Proc Int Conf, 3: 53-56.

同被引文献34

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部