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 条
  • [41] Solving the Double Transposition Challenge with a Divide-and-Conquer Approach
    Lasry, George
    Kopal, Nils
    Wacker, Arno
    CRYPTOLOGIA, 2014, 38 (03) : 197 - 214
  • [42] A divide-and-conquer approach with adaptive modulation to CDMA systems
    Dwivedi, S
    Vedavathy, TS
    Shivaprasad, AP
    GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 1175 - 1179
  • [43] Performance of the divide-and-conquer approach used as an initial guess
    Shoji, Mitsuo
    Kayanuma, Megumi
    Umeda, Hiroaki
    Shigeta, Yasuteru
    CHEMICAL PHYSICS LETTERS, 2015, 634 : 181 - 187
  • [44] ON THE BALANCED DIVIDE-AND-CONQUER EQUATION
    BATAGELJ, V
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 19 (3-4) : 259 - 266
  • [45] DIVIDE-AND-CONQUER IN PLANAR GEOMETRY
    GUTING, RH
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 18 (3-4) : 247 - 263
  • [46] A divide-and-conquer approach for automatic polycube map construction
    He, Ying
    Wang, Hongyu
    Fu, Chi-Wing
    Qin, Hong
    COMPUTERS & GRAPHICS-UK, 2009, 33 (03): : 369 - 380
  • [47] Design of electronic circuits using a divide-and-conquer approach
    He, Guoliang
    Li, Yuanxiang
    Yu, Li
    Zhang, Wei
    Tu, Hang
    EVOLVABLE SYSTEMS: FROM BIOLOGY TO HARDWARE, PROCEEDINGS, 2007, 4684 : 13 - +
  • [48] Naive Ray-Tracing: A Divide-And-Conquer Approach
    Mora, Benjamin
    ACM TRANSACTIONS ON GRAPHICS, 2011, 30 (05):
  • [49] PIPELINES FOR DIVIDE-AND-CONQUER FUNCTIONS
    DEGUZMAN, IP
    HARRISON, PG
    MEDINA, E
    COMPUTER JOURNAL, 1993, 36 (03): : 254 - 268
  • [50] DIVIDE-AND-CONQUER FOR PARALLEL PROCESSING
    HOROWITZ, E
    ZORAT, A
    IEEE TRANSACTIONS ON COMPUTERS, 1983, 32 (06) : 582 - 585