Paper Info
Title
Geometry-aware partitioning of complex domains for parallel quad meshing.
Abstract
We develop a partitioning algorithm to decompose complex 2D data into small and simple subregions suitable for effective distributed and parallel quadrilateral mesh generation. To support high-quality quad mesh generation, the partitioning reduces to solving an integer quadratic optimization problem with linear constraints. Directly solving this problem is expensive for large-scale data. Hence, we also suggest a more efficient two-step algorithm to obtain an approximate solution. First, we partition the region into a set of cells using L Centroidal Voronoi Tessellation (CVT), then we solve a graph partitioning on the dual graph of this CVT to minimize the total partitioning boundary length, while enforcing the load balancing and each subregions connectivity. With this decomposition, subregions are distributed to multiple processors for parallel mesh generation. Through comparisons on the quality of the final meshes and the performance of simulations run on these meshes, we show that our decomposition algorithm outperforms existing partitioning approaches by offering more simulation-friendly regular meshes. A new data partitioning algorithm for large-scale quad mesh generation.A parallel computing framework for distributed geometric processing and meshing.A quad mesh generator for efficient scientific simulations of large geometric data.
Year
DOI
Venue
2017
10.1016/j.cad.2016.07.014
Computer-Aided Design
Keywords
Field
DocType
Geometry-aware data partitioning,Parallel mesh generation,Large-scale regular meshing
Mathematical optimization,Centroidal Voronoi tessellation,Polygon mesh,Computer science,Load balancing (computing),Parallel computing,Dual graph,Quadratic programming,Graph partition,Parallel mesh generation,Mesh generation
Journal
Volume
Issue
ISSN
85
C
0010-4485
Citations 
PageRank 
References 
4
0.38
26
Authors
3
Name
Order
Citations
PageRank
Xin Li125819.84
Wuyi Yu2574.94
Celong Liu392.20