loading...
A General Framework for Parallel Planar Mesh Generation
Hangzhou, Zhejiang, China June 20-June 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.72006 First International Multi-Sympos ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ligang Chen, Zhejiang University, China
Yi Liang, Zhejiang University, China
Jianjun Chen, Zhejiang University, China
Yao Zheng, Zhejiang University, China
In this paper, we present a general framework for 2D parallel mesh generation. A prepartitioner for domain decomposition is integrated into the framework, which strives to make the resulting subdomains wellshaped and thus guarantees the high quality of resulting meshes. Moreover, the time-consuming prepartitioning stage is parallelized in two ways with various grained levels, and the finer grained one turns out preferable. The subdomain connections are stored as a SubDomain Graph (SDG), which helps prevent mapping disconnected subdomains into a single processor whenever static or dynamic load balancing strategies are adopted. Well partitioned meshes could be generated simultaneously with parallel mesh generation, and hence the cost of mesh repartitioning could be eliminated or reduced. The SDG construction is simplified and independent of domain decomposition by introducing the concept of the Characteristic Polygon Set (CPS). Shared nodes between neighboring subdomains are duplicated, that ensures subdomain meshing be completed with little or without communications, and full code-reuse of serial meshing algorithms be achieved in this framework.
Citation:
Ligang Chen, Yi Liang, Jianjun Chen, Yao Zheng, "A General Framework for Parallel Planar Mesh Generation," imsccs, vol. 1, pp.430-436, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.