Boundary-Trimmed 3D Triangular Mesh Segmentation Based on Iterative Merging Strategy

Title
Boundary-Trimmed 3D Triangular Mesh Segmentation Based on Iterative Merging Strategy
Authors
김동환윤일동이상욱
Keywords
Mesh; Segmentation; Partitioning; Hierarchical Clustering; Boundary Trimming
Issue Date
2006-05
Publisher
Pattern recognition
Citation
VOL 39, NO 5, 827-838
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.
URI
http://pubs.kist.re.kr/handle/201004/37667
ISSN
0031-3203
Appears in Collections:
KIST Publication > Article
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE