title: Mesh segmentation with concavity-aware fields.
abstract: This paper presents a simple and efficient automatic mesh segmentation algorithm that solely exploits the shape concavity information. The method locates concave creases and seams using a set of concavity-sensitive scalar fields. These fields are computed by solving a Laplacian system with a novel concavity-sensitive weighting scheme. Isolines sampled from the concavity-aware fields naturally gather at concave seams, serving as good cutting boundary candidates. In addition, the fields provide sufficient information allowing efficient evaluation of the candidate cuts. We perform a summarization of all field gradient magnitudes to define a score for each isoline and employ a score-based greedy algorithm to select the best cuts. Extensive experiments and quantitative analysis have shown that the quality of our segmentations are better than or comparable with existing state-of-the-art more complex approaches.
authors.affiliation: School of Creative Media, The City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong. kincau@cityu.edu.hk
authors.forename: Oscar Kin-Chung
authors.initials: OK
authors.lastname: Au
authors.forename: Youyi
authors.initials: Y
authors.lastname: Zheng
authors.forename: Menglin
authors.initials: M
authors.lastname: Chen
authors.forename: Pengfei
authors.initials: P
authors.lastname: Xu
authors.forename: Chiew-Lan
authors.initials: CL
authors.lastname: Tai