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] Divide-and-conquer for Voronoi diagrams revisited
    Aichholzer, Oswin
    Aigner, Wolfgang
    Aurenhammer, Franz
    Hackl, Thomas
    Juettler, Bert
    Pilgerstorfer, Elisabeth
    Rabl, Margot
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (08): : 688 - 699
  • [22] DIVIDE-AND-CONQUER AND PARALLEL GRAPH REDUCTION
    RABHI, FA
    MANSON, GA
    PARALLEL COMPUTING, 1991, 17 (2-3) : 189 - 205
  • [23] A nearest-neighbor divide-and-conquer approach for adaptive random testing
    Huang, Rubing
    Sun, Weifeng
    Chen, Haibo
    Cui, Chenhui
    Yang, Ning
    SCIENCE OF COMPUTER PROGRAMMING, 2022, 215
  • [24] A divide-and-conquer deep learning approach to reconstruct flow and temperature fields
    Peng, Xingwen
    Yao, Wen
    Li, Xingchen
    Chen, Xiaoqian
    INTERNATIONAL JOURNAL OF HEAT AND FLUID FLOW, 2025, 112
  • [25] Divide-and-conquer approach for solving singular value decomposition based on MapReduce
    Zhao, Shuoyi
    Li, Ruixuan
    Tian, Wenlong
    Xiao, Weijun
    Dong, Xinhua
    Liao, Dongjie
    Khan, Samee U.
    Li, Keqin
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2016, 28 (02) : 331 - 350
  • [26] Improving Divide-And-Conquer Ray-Tracing Using a Parallel Approach
    de Lara Pahins, Cicero Augusto
    Pozzer, Cesar Tadeu
    2014 27TH SIBGRAPI CONFERENCE ON GRAPHICS, PATTERNS AND IMAGES (SIBGRAPI), 2014, : 9 - 16
  • [27] A divide-and-conquer recursive approach for scaling up instance selection algorithms
    Aida de Haro-García
    Nicolás García-Pedrajas
    Data Mining and Knowledge Discovery, 2009, 18 : 392 - 418
  • [28] A divide-and-conquer recursive approach for scaling up instance selection algorithms
    de Haro-Garcia, Aida
    Garcia-Pedrajas, Nicolas
    DATA MINING AND KNOWLEDGE DISCOVERY, 2009, 18 (03) : 392 - 418
  • [29] STATIC ANALYSIS FOR DIVIDE-AND-CONQUER PATTERN DISCOVERY
    Kozsik, Tamas
    Toth, Melinda
    Istvan Bozo
    Horvath, Zoltan
    COMPUTING AND INFORMATICS, 2016, 35 (04) : 764 - 791
  • [30] Divide-and-Conquer Parallelism for Learning Mixture Models
    Kawakatsu, Takaya
    Kinoshita, Akira
    Takasu, Atsuhiro
    Adachi, Jun
    TRANSACTIONS ON LARGE-SCALE DATA- AND KNOWLEDGE-CENTERED SYSTEMS XXVIII: SPECIAL ISSUE ON DATABASE- AND EXPERT-SYSTEMS APPLICATIONS, 2016, 9940 : 23 - 47