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] Design of Automatic Visualizations for Divide-and-Conquer Algorithms
    Angel Velazquez-Iturbide, J.
    Perez-Carrasco, Antonio
    Urquiza-Fuentes, Jaime
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 224 (0C) : 159 - 167
  • [43] A fast approach based on divide-and-conquer for instance selection in classification problemA fast approach based on divide-and-conquer for instance selection in classification problemH. Saadatfar et al.
    Hamid Saadatfar
    Sayed Iqbal Nawin
    Edris Hosseini Gol
    Applied Intelligence, 2025, 55 (7)
  • [44] Route planning using divide-and-conquer: A GAT enhanced insertion transformer approach
    Zhang, Pujun
    Liu, Shan
    Shi, Jia
    Chen, Liying
    Chen, Shuiping
    Gao, Jiuchong
    Jiang, Hai
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2023, 176
  • [45] Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment
    Stoye, J
    Perrey, SW
    Dress, AWM
    APPLIED MATHEMATICS LETTERS, 1997, 10 (02) : 67 - 73
  • [46] BIC-based audio segmentation by divide-and-conquer
    Cheng, Shih-Sian
    Wang, Hsin-Min
    Fu, Hsin-Chia
    2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12, 2008, : 4841 - +
  • [47] A divide-and-conquer method for sparse risk prediction and evaluation
    Hong, Chuan
    Wang, Yan
    Cai, Tianxi
    BIOSTATISTICS, 2022, 23 (02) : 397 - 411
  • [48] Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods
    Liu, Fukang
    Isobe, Takanori
    ADVANCES IN INFORMATION AND COMPUTER SECURITY, IWSEC 2019, 2019, 11689 : 306 - 326
  • [49] A Parallel Skeleton for Divide-and-conquer Unbalanced and Deep Problems
    Millán A. Martínez
    Basilio B. Fraguela
    José C. Cabaleiro
    International Journal of Parallel Programming, 2021, 49 : 820 - 845
  • [50] Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods
    Liu, Fukang
    Isobe, Takanori
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (11) : 1260 - 1273