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 条
  • [31] Modular Divide-and-Conquer Parallelization of Nested Loops
    Farzan, Azadeh
    Nicolet, Victor
    PROCEEDINGS OF THE 40TH ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '19), 2019, : 610 - 624
  • [32] A Divide-and-Conquer Genetic Programming Algorithm With Ensembles for Image Classification
    Bi, Ying
    Xue, Bing
    Zhang, Mengjie
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (06) : 1148 - 1162
  • [33] Improved master theorems for divide-and-conquer recurrences
    Roura, S
    JOURNAL OF THE ACM, 2001, 48 (02) : 170 - 205
  • [34] A Divide-and-Conquer Algorithm for Computing Voronoi Diagrams
    Smith, Elijah
    Trefftz, Christian
    DeVries, Byron
    2020 IEEE INTERNATIONAL CONFERENCE ON ELECTRO INFORMATION TECHNOLOGY (EIT), 2020, : 495 - 499
  • [35] ON THE ORTHOGONALITY OF EIGENVECTORS COMPUTED BY DIVIDE-AND-CONQUER TECHNIQUES
    SORENSEN, DC
    PING, TPT
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 1991, 28 (06) : 1752 - 1775
  • [36] Generating synchronization statements in divide-and-conquer programs
    Hijma, Pieter
    van Nieuwpoort, Rob V.
    Jacobs, Ceriel J. H.
    Bal, Henri E.
    PARALLEL COMPUTING, 2012, 38 (1-2) : 75 - 89
  • [37] A fast divide-and-conquer sparse Cox regression
    Wang, Yan
    Hong, Chuan
    Palmer, Nathan
    Di, Qian
    Schwartz, Joel
    Kohane, Isaac
    Cai, Tianxi
    BIOSTATISTICS, 2021, 22 (02) : 381 - 401
  • [38] A DIVIDE-AND-CONQUER ALGORITHM FOR THE SYMMETRICAL TRIDIAGONAL EIGENPROBLEM
    GU, M
    EISENSTAT, SC
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (01) : 172 - 191
  • [39] Efficient Divide-and-Conquer Implementations of Symmetric FSAs
    Pritchard, David A. G.
    JOURNAL OF CELLULAR AUTOMATA, 2010, 5 (06) : 481 - 490
  • [40] Divide-and-Conquer Completion Network for Video Inpainting
    Wu, Zhiliang
    Sun, Changchang
    Xuan, Hanyu
    Zhang, Kang
    Yan, Yan
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2023, 33 (06) : 2753 - 2766