바로가기메뉴

본문 바로가기 주메뉴 바로가기

ACOMS+ 및 학술지 리포지터리 설명회

  • 한국과학기술정보연구원(KISTI) 서울분원 대회의실(별관 3층)
  • 2024년 07월 03일(수) 13:30
 

logo

A Greedy Merging Method for User-Steered Mesh Segmentation

INTERNATIONAL JOURNAL OF CONTENTS / INTERNATIONAL JOURNAL OF CONTENTS, (P)1738-6764; (E)2093-7504
2007, v.3 no.2, pp.25-29
https://doi.org/10.5392/ijoc.2007.3.2.025
Ha, Jong-Sung (Department of Game and Contents Woosuk University)
Park, Young-Jin (Department of Information Industrial Engineering Chungbuk National University)
Yoo, Kwan-Hee (Department of Computer Education, and Department of Information Industrial Engineering Chungbuk National University)

Abstract

In this paper, we discuss the mesh segmentation problem which divides a given 3D mesh into several disjoint sets. To solve the problem, we propose a greedy method based on the merging priority metric defined for representing the geometric properties of meaningful parts. The proposed priority metric is a weighted function using five geometric parameters, those are, a distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. In special, we can control by setting up the weight values of the proposed geometric parameters to obtain visually better mesh segmentation. Finally, we carry out an experiment on several 3D mesh models using the proposed methods and visualize the results.

keywords
Mesh Segmentation, Greedy Merging, Feature, User-Steered

INTERNATIONAL JOURNAL OF CONTENTS