Boundary-Trimmed 3D Triangular Mesh Segmentation Based on Iterative Merging Strategy
- Boundary-Trimmed 3D Triangular Mesh Segmentation Based on Iterative Merging Strategy
- 김동환; 윤일동; 이상욱
- Mesh; Segmentation; Partitioning; Hierarchical Clustering; Boundary Trimming
- Issue Date
- Pattern recognition
- VOL 39, NO 5, 827-838
- 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.
- Appears in Collections:
- KIST Publication > Article
- Files in This Item:
There are no files associated with this item.
- RIS (EndNote)
- XLS (Excel)
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.