TY - JOUR
T1 - Variational mesh segmentation via quadric surface fitting
AU - Yan, Dongming
AU - Wang, Wen Ping
AU - Liu, Yang
AU - Yang, Zhouwang
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: We would like to thank the reviewers for their detailed comments and suggestions which greatly improved the manuscript. We also thank Xiaohong Jia and Yong-Liang Yang for proofreading. This work is partially supported by the Research Grant Council of Hong Kong (718209 and 718010), NSFC (11171322), and ANR/NSFC (60625202, 60911130368) Program.
PY - 2012/11
Y1 - 2012/11
N2 - We present a new variational method for mesh segmentation by fitting quadric surfaces. Each component of the resulting segmentation is represented by a general quadric surface (including plane as a special case). A novel energy function is defined to evaluate the quality of the segmentation, which combines both L2 and L2 ,1 metrics from a triangle to a quadric surface. The Lloyd iteration is used to minimize the energy function, which repeatedly interleaves between mesh partition and quadric surface fitting. We also integrate feature-based and simplification-based techniques in the segmentation framework, which greatly improve the performance. The advantages of our algorithm are demonstrated by comparing with the state-of-the-art methods. © 2012 Elsevier Ltd. All rights reserved.
AB - We present a new variational method for mesh segmentation by fitting quadric surfaces. Each component of the resulting segmentation is represented by a general quadric surface (including plane as a special case). A novel energy function is defined to evaluate the quality of the segmentation, which combines both L2 and L2 ,1 metrics from a triangle to a quadric surface. The Lloyd iteration is used to minimize the energy function, which repeatedly interleaves between mesh partition and quadric surface fitting. We also integrate feature-based and simplification-based techniques in the segmentation framework, which greatly improve the performance. The advantages of our algorithm are demonstrated by comparing with the state-of-the-art methods. © 2012 Elsevier Ltd. All rights reserved.
UR - http://hdl.handle.net/10754/562378
UR - https://linkinghub.elsevier.com/retrieve/pii/S0010448512000887
UR - http://www.scopus.com/inward/record.url?scp=84861949815&partnerID=8YFLogxK
U2 - 10.1016/j.cad.2012.04.005
DO - 10.1016/j.cad.2012.04.005
M3 - Article
SN - 0010-4485
VL - 44
SP - 1072
EP - 1082
JO - Computer-Aided Design
JF - Computer-Aided Design
IS - 11
ER -