Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy

  • Authors:
  • Dong Hwan Kim;Il Dong Yun;Sang Uk Lee

  • Affiliations:
  • School of Electrical Engineering, Seoul National University, Seoul 151-742, Korea;School of Electronics and Information Engineering, Hankuk University of Foreign Studies, Yongin 449-791, Korea;School of Electrical Engineering, Seoul National University, Seoul 151-742, Korea

  • Venue:
  • Pattern Recognition
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a segmentation algorithm for 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on their orientations. The oversegmented regions are merged again in an iterative region merging process. Finally, the noisy boundaries of each region are refined. The boundaries of each region contain perceptually important geometric information of the entire mesh model. According to the purpose of the segmentation, the proposed mesh-segmentation algorithm supports various types of segmentation by controlling parameters.