A Divide-and-Conquer Approach to Quad Remeshing

被引:5
|
作者
Zhang, Muyang [1 ]
Huang, Jin [1 ]
Liu, Xinguo [1 ]
Bao, Hujun [1 ]
机构
[1] Zhejiang Univ, State Key Lab CAD&CG, Hangzhou 310058, Zhejiang, Peoples R China
关键词
Quad remeshing; divide-and-conquer; segmentation; mixed-integer optimization; MESH; OPTIMIZATION;
D O I
10.1109/TVCG.2012.301
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Many natural and man-made objects consist of simple primitives, similar components, and various symmetry structures. This paper presents a divide-and-conquer quadrangulation approach that exploits such global structural information. Given a model represented in triangular mesh, we first segment it into a set of submeshes, and compare them with some predefined quad mesh templates. For the submeshes that are similar to a predefined template, we remesh them as the template up to a number of subdivisions. For the others, we adopt the wave-based quadrangulation technique to remesh them with extensions to preserve symmetric structure and generate compatible quad mesh boundary. To ensure that the individually remeshed submeshes can be seamlessly stitched together, we formulate a mixed-integer optimization problem and design a heuristic solver to optimize the subdivision numbers and the size fields on the submesh boundaries. With this divider-and-conquer quadrangulation framework, we are able to process very large models that are very difficult for the previous techniques. Since the submeshes can be remeshed individually in any order, the remeshing procedure can run in parallel. Experimental results showed that the proposed method can preserve the high-level structures, and process large complex surfaces robustly and efficiently.
引用
收藏
页码:941 / 952
页数:12
相关论文
共 50 条
  • [21] Gaussian Process Learning: A Divide-and-Conquer Approach
    Li, Wenye
    ADVANCES IN NEURAL NETWORKS - ISNN 2014, 2014, 8866 : 262 - 269
  • [22] A divide-and-conquer approach for content replication in WMNs
    Al-Arnaout, Zakwan
    Fu, Qiarig
    Frean, Marcus
    COMPUTER NETWORKS, 2013, 57 (18) : 3914 - 3928
  • [23] A Divide-and-Conquer Approach to the Summarization of Long Documents
    Gidiotis, Alexios
    Tsoumakas, Grigorios
    IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2020, 28 (28) : 3029 - 3040
  • [24] A divide-and-conquer approach to compressed sensing MRI
    Sun, Liyan
    Fan, Zhiwen
    Ding, Xinghao
    Cai, Congbo
    Huang, Yue
    Paisley, John
    MAGNETIC RESONANCE IMAGING, 2019, 63 : 37 - 48
  • [25] A Divide-and-Conquer Approach Towards Understanding Deep Networks
    Fu, Weilin
    Breininger, Katharina
    Schaffert, Roman
    Ravikumar, Nishant
    Maier, Andreas
    MEDICAL IMAGE COMPUTING AND COMPUTER ASSISTED INTERVENTION - MICCAI 2019, PT I, 2019, 11764 : 183 - 191
  • [26] A divide-and-conquer approach to analyze underdetermined biochemical models
    Kotte, Oliver
    Heinemann, Matthias
    BIOINFORMATICS, 2009, 25 (04) : 519 - 525
  • [27] EIGENVALUES OF A SYMMETRICAL TRIDIAGONAL MATRIX - A DIVIDE-AND-CONQUER APPROACH
    KRISHNAKUMAR, AS
    MORF, M
    NUMERISCHE MATHEMATIK, 1986, 48 (03) : 349 - 368
  • [28] JuliusC: A practical approach for the analysis of divide-and-conquer algorithms
    D'Alberto, P
    Nicolau, A
    LANGUAGES AND COMPILERS FOR HIGH PERFORMANCE COMPUTING, 2005, 3602 : 117 - 131
  • [29] SAR processing in small pieces - a divide-and-conquer approach
    Larsen, Yngvar
    Engen, Geir
    10TH EUROPEAN CONFERENCE ON SYNTHETIC APERTURE RADAR (EUSAR 2014), 2014,
  • [30] A Divide-and-Conquer Approach for Solving Interval Algebra Networks
    Li, Jason Jingshi
    Huang, Jinbo
    Renz, Jochen
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 572 - 577