Distributed poly-square mapping for large-scale semi-structured quad mesh generation

We develop a distributed poly-square mapping algorithm for large-scale 2D geometric regions, which is suitable for generating huge quadrilateral meshes in parallel using computer clusters. Our approach adopts a divide-and-conquer strategy based on domain decomposition. We first partition the data in...

Full description

Saved in:
Bibliographic Details
Published in:Computer aided design 2017-09, Vol.90, p.5-17
Main Authors: Liu, Celong, Yu, Wuyi, Chen, Zhonggui, Li, Xin
Format: Article
Language:English
Subjects:
CAE
Clusters
Computer aided engineering
Distributed poly-square maps
Geometry
Large-scale quad meshing
Mapping
Mesh generation
Optimization algorithms
Semi-structured quad meshing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We develop a distributed poly-square mapping algorithm for large-scale 2D geometric regions, which is suitable for generating huge quadrilateral meshes in parallel using computer clusters. Our approach adopts a divide-and-conquer strategy based on domain decomposition. We first partition the data into solvable subregions, balancing their size, geometry, and communication cost; then, poly-square maps will be solved on subregions; these maps are finally merged and optimized globally through a multi-pass optimization algorithm. We demonstrate that our meshing framework can handle very big and complex geometric datasets using high performance clusters efficiently and generate high-quality semi-structured quad meshes. •A new distributed poly-square mapping (DPSM) algorithm for parallel parameterization of extremely big and complex 2D geometries.•A poly-square parameterization that supports the introduction of interior singularities to reduce mapping distortion.•A distributed and parallel semi-structured meshing algorithm for complex 2D geometries, with good scalability, iterative layout refinement. [Display omitted]
ISSN:0010-4485
1879-2685
DOI:10.1016/j.cad.2017.05.005