Continuous skeleton computation by Voronoi diagram
CVGIP: Image Understanding
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Multithreaded model for the dynamic load-balancing of parallel adaptive PDE computations
Applied Numerical Mathematics - Special issue on adaptive mesh refinement methods for CFD applications
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Delaunay mesh generation governed by metric specifications. Part II. applications
Finite Elements in Analysis and Design
Automatic unstructured grid generators
Finite Elements in Analysis and Design
Parallel dynamic graph partitioning for adaptive unstructured meshes
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
A Load Balancing Framework for Adaptive and Asynchronous Applications
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 18th annual international conference on Supercomputing
Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
SIAM Journal on Scientific Computing
Three-dimensional delaunay refinement for multi-core processors
Proceedings of the 22nd annual international conference on Supercomputing
A multigrain Delaunay mesh generation method for multicore SMT-based architectures
Journal of Parallel and Distributed Computing
A template for developing next generation parallel Delaunay refinement methods
Finite Elements in Analysis and Design
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
We present a geometric domain decomposition method and its implementation, which produces good domain decompositions in terms of three basic criteria: (1) The boundary of the subdomains create good angles, that is, angles no smaller than a given tolerance Φ0, where the value of Φ0 is determined by the application which will use the domain decomposition. (2) The size of the separator should be relatively small compared to the area of the subdomains. (3) The maximum area of the subdomains should be close to the average subdomain area. The domain decomposition method uses an approximation of a Medial Axis as an auxiliary structure for constructing the boundary of the subdomains (separators). The N-way decomposition is based on the “divide and conquer” algorithmic paradigm and on a smoothing procedure that eliminates the creation of any new artifacts in the subdomains. This approach produces well shaped uniform and graded domain decompositions, which are suitable for parallel mesh generation.