Mesh scissoring with minima rule and part salience
SCIE
SCOPUS
- Title
- Mesh scissoring with minima rule and part salience
- Authors
- Lee, Y; Lee, S; Shamir, A; Cohen-Or, D; Seidel, HP
- Date Issued
- 2005-07
- Publisher
- ELSEVIER SCIENCE BV
- Abstract
- This paper presents an intelligent scissoring operator for meshes. Unlike common approaches that segment a mesh using clustering schemes, here we introduce a method that concentrates on the contours for cutting. Our approach is based on the minima rule and part salience theory from the cognitive theory. The minima rule states that human perception usually divides a surface into parts along the concave discontinuity of the tangent plane. The part salience theory provides factors which determine the salience of segments. Our method first extracts features to find candidate contours based on the minima rule. Subsequently, these open contours are prioritized to select the most salient one. Then, the selected open contour is automatically completed to form a loop around a specific part of the mesh. This loop is used as the initial position of a 3D geometric snake. Before applying a snake, we measure the part salience of the segments obtained by the completed contour. If conditions for the salience are not met, the contour is rejected. Otherwise, the snake moves by relaxation until it settles to define the final scissoring position. In this paper, we focus on a fully automatic scissoring scheme; nevertheless, we also report on semi-automatic user interfaces for intelligent scissoring which are easy to use and intuitive. (C) 2005 Elsevier B.V. All rights reserved.
- Keywords
- mesh segmentation; mesh partitioning; part-type segmentation; geometric snake; ACTIVE CONTOUR; SEGMENTATION; DECOMPOSITION; MODEL
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/24477
- DOI
- 10.1016/j.cagd.2005.04.002
- ISSN
- 0167-8396
- Article Type
- Article
- Citation
- COMPUTER AIDED GEOMETRIC DESIGN, vol. 22, no. 5, page. 444 - 465, 2005-07
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.