Extracting Cycle-aware Feature Curve Networks from 3D Models

被引:8
作者
Lu, Zhengda [1 ,2 ]
Guo, Jianwei [1 ,2 ]
Xiao, Jun [1 ]
Wang, Ying [1 ]
Zhang, Xiaopeng [1 ,2 ]
Yan, Dong-Ming [1 ,2 ]
机构
[1] Univ Chinese Acad Sci, Sch Artificial Intelligence, Beijing 100049, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing 100190, Peoples R China
基金
北京市自然科学基金;
关键词
Shape analysis; Feature curve network; Segmentation;
D O I
10.1016/j.cad.2020.102949
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Meaningful feature curves provide high-level shape representation of the geometrical shapes and are useful in various applications. In this paper, we propose an automatic method on the basis of the quadric surface fitting technique to extract complete feature curve networks (FCNs) from 3D surface meshes, as well as finding cycles and generating a high-quality segmentation. In the initial collection of noisy and fragmented feature curves, we first fit the quadric surfaces of each curve and the corresponding neighbor vertices to filter out non-salient or noisy feature curves. Then we conduct a feature extension step to address the curve intersections and form a closed FCN. Finally, we regard circle curves as cycles in the complete FCN and segment the mesh into patches to reveal a highly structured representation of the input geometry. Experimental results demonstrate that our algorithm is more robust for FCN extraction from complex input meshes and achieves higher quality patch layouts compared with the state-of-the-art approaches. We also verify the validity of extracted feature curve cycles by applying them to surface reconstruction. (c) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:11
相关论文
共 41 条
[1]   Surface Patches from Unorganized Space Curves [J].
Abbasinejad, Fatemeh ;
Joshi, Pushkar ;
Amenta, Nina .
COMPUTER GRAPHICS FORUM, 2011, 30 (05) :1379-1387
[2]   Design-Driven Quadrangulation of Closed 3D Curves [J].
Bessmeltsev, Mikhail ;
Wang, Caoyu ;
Sheffer, Alla ;
Singh, Karan .
ACM TRANSACTIONS ON GRAPHICS, 2012, 31 (06)
[3]   Patch layout generation by detecting feature networks [J].
Cao, Yuanhao ;
Yan, Dong-Ming ;
Wonka, Peter .
COMPUTERS & GRAPHICS-UK, 2015, 46 :275-282
[4]   A Benchmark for 3D Mesh Segmentation [J].
Chen, Xiaobai ;
Golovinskiy, Aleksey ;
Funkhouser, Thomas .
ACM TRANSACTIONS ON GRAPHICS, 2009, 28 (03)
[5]   Variational shape approximation [J].
Cohen-Steiner, D ;
Alliez, P ;
Desbrun, M .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :905-914
[6]   EXOSKELETON: Curve network abstraction for 3D shapes [J].
de Goes, Fernando ;
Goldenstein, Siome ;
Desbrun, Mathieu ;
Velho, Luiz .
COMPUTERS & GRAPHICS-UK, 2011, 35 (01) :112-121
[7]   Interactive Curve Constrained Functional Maps [J].
Gehre, A. ;
Bronstein, M. ;
Kobbelt, L. ;
Solomon, J. .
COMPUTER GRAPHICS FORUM, 2018, 37 (05) :1-12
[8]   Feature Curve Co-Completion in Noisy Data [J].
Gehre, Anne ;
Lim, Isaak ;
Kobbelt, Leif .
COMPUTER GRAPHICS FORUM, 2018, 37 (02) :1-12
[9]   Adapting Feature Curve Networks to a Prescribed Scale [J].
Gehre, Anne ;
Lim, Isaak ;
Kobbelt, Leif .
COMPUTER GRAPHICS FORUM, 2016, 35 (02) :319-330
[10]   FlowRep: Descriptive Curve Networks for Free-Form Design Shapes [J].
Gori, Giorgio ;
Sheffer, Alla ;
Vining, Nicholas ;
Rosales, Enrique ;
Carr, Nathan ;
Ju, Tao .
ACM TRANSACTIONS ON GRAPHICS, 2017, 36 (04)