기하학 특성을 반영한 측지거리 계층적 메쉬 분할
Geodesic Hierarchical Mesh Segmentation Reflecting Geometric Characteristics
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
본 논문에서는 게임 캐릭터 모델의 텍스춰 매핑에 응용 가능한 3차원 메쉬 분할 문제를 기하학 특성을 반영한 계층적 과정을 통해 처리할 수 있는 기법을 제안한다. 이 기법에서는 우선적으로 메쉬의 기하학 특성이 잘 나타나도록 곡률과 볼록성을 분석한 후, 이들 성질을 이용하여 분할된 영역의 중심점 후보 가능성이 있는 첨예정점을 추출하고 우선순위를 부여하였다. 높은 우선순위를 갖는 첨예정점을 메쉬 표면에서 정의되는 두 점간의 측지거리와 계층적 군집화 기법을 이용하여 분할을 처리한다. 낮은 우선순위를 갖는 첨예정점을 분배한 후, 나머지 정점들에 대해서도 기하학 측정치를 이용한 분할을 통해 메쉬 분할이 완성된다. 특히, 본 논문에서는 기하학 특성에 따라 주어진 메쉬 분할의 군집 개수를 계층적 군집화를 수행하면서 자동으로 계산하는 기법을 제시하였다.
Abstract
In this paper, we propose a method for processing 3D mesh segmentation problem, which is applicable to texture mapping of game character models, using hierarchical procedures reflecting geometric characteristics of a given mesh. First of all, the method analyzes curvatures and convexity so that geometric characteristics of a mesh are appearing very well, and then extracts sharp vertices with priority which may be selected as centroids of decomposed regions using them. Sharp vertices with higher priority are divided into a set of groups by using hierarchical clustering methods and a geodesic distance metric, which is defined on surface of a mesh, between each pair of the sharp vertices. After performing the distribution of sharp vertices with lower priority, a mesh segmentation is completed through the distribution of all but sharp vertices. Specially, a reasonable number of groups of a given mesh based on geometric characteristics is automatically computed during processing hierarchical clustering.
참고문헌 (18)
- B. Chazelle, "Strategies for polyhedral surface decomposition: an experimental study", Computational Geometry: Theory and Applications, 7, pp.327~342 (1997)
- M. Attene, "Mesh segmentation - a comparative study", Conf. on Shape Modeling and Applications, pp.14~25 (2006), IEEE
- A. P. Mangan, "Partitioning 3D surface meshes using watershed segmentation", IEEE Transactions on Visualization and Computer Graphics, 5(4), pp.308~321 (1999)
- Y.J. Lee, "Intelligent mesh scissoring using 3d snakes", Proc. of Pacific Graphics, pp.279~287 (2004)
- Kwan-Hee Yoo, "User-Steered Methods for Extracting of Geometric Features in 3D Meshes", Computer-Aided Design and Applications, 2(4), pp.539~546 (2005)
- M. Garland, "Hierarchical face clustering on polygonal surfaces", Proc. of the 2001 Symposium on Interactive 3D Graphics, pp.49~58 (2001)
- S. Katz, "Hierarchical mesh decomposition using fuzzy clustering and cuts", ACM Transactions on Graphics, 22(3), pp.954~961 (2003)
- Y. Zhou, "Decomposing polygon meshes by means of critical points", Proc. of MMM'04, pp.187~195 (2004)
- S. Katz, "Mesh segmentation using feature points and core extraction", Visual Computer, 21, pp.649~658 (2005)
- M. Mortara, "Blowing bubbles for the multi-scale analysis and decomposition of traingle meshes", Algorithmica Special Issues on Shape Algorithms, 38(2), pp.224~227 (2004)
- Approximate convex decomposition of polyhedra, "J. M. Lien", Texas A&M University, ~, pp.Technical Report TR06-002 (2006)
- J.H. Lim, "A Mesh Segmentation Reflecting Global and Local Geometric Characteristics", Journal of KIPS, 14(7), pp.435~442 (2007)
- Y.J. Park, "Mesh Segmenation with Geodesic Means Clustering of Sharp Vertices", Journal of Contents, 8(5), pp.94~103 (2007)
- F. Yamaguchi, "Curves and surfaces in Computer Aided Geometric Design" (1988), Springer-Berlag
- S. C. Johnson, "Hierarchical Clustering Schemes", Psychometrika, 2, pp.241~254 (1967)
- "Computational geometry algorithm library"[URL]
- The Princeton shape benchmark, "P. Shilane", Proc. of Shape Modeling International, ~ (2004)
- E. W. Dijkstra, "A note on two problems in connexion with graphs", In Numerische Mathematik, 1, pp.269~271 (1959)