Constrained Delaunay triangulations
SCG '87 Proceedings of the third annual symposium on Computational geometry
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
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 Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Developing a practical projection-based parallel Delaunay algorithm
Proceedings of the twelfth annual symposium on Computational geometry
PELLPACK: a problem-solving environment for PDE-based applications on multicomputer platforms
ACM Transactions on Mathematical Software (TOMS)
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
Delaunay refinement mesh generation
Delaunay refinement mesh generation
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
Time complexity of practical parallel steiner point insertion algorithms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Communication Support for Dynamic Load Balancing of Irregular Adaptive Applications
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Parallel delaunay refinement mesh generation
Parallel delaunay refinement mesh generation
Flow Past a Stationary and Moving Cylinder: DNS at Re=10,000
DOD_UGC '04 Proceedings of the 2004 Users Group Conference
Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
SIAM Journal on Scientific Computing
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
Parallel decoupled terminal-edge bisection method for 3D mesh generation
Engineering with Computers
Parallel Guaranteed Quality Delaunay Uniform Mesh Refinement
SIAM Journal on Scientific Computing
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
On the Scalability of an Automatically Parallelized Irregular Application
Languages and Compilers for Parallel Computing
A multigrain Delaunay mesh generation method for multicore SMT-based architectures
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software
Journal of Experimental Algorithmics (JEA)
Multithread parallelization of Lepp-bisection algorithms
Applied Numerical Mathematics
High quality real-time image-to-mesh conversion for finite element simulations
Proceedings of the 27th international ACM conference on International conference on supercomputing
Multi-layered unstructured mesh generation
Proceedings of the 27th international ACM conference on International conference on supercomputing
High quality real-time Image-to-Mesh conversion for finite element simulations
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Delaunay refinement is a widely used method for the construction of guaranteed quality triangular and tetrahedral meshes. We present an algorithm and a software for the parallel constrained Delaunay mesh generation in two dimensions. Our approach is based on the decomposition of the original mesh generation problem into N smaller subproblems which are meshed in parallel. The parallel algorithm is asynchronous with small messages which can be aggregated and exhibits low communication costs. On a heterogeneous cluster of more than 100 processors our implementation can generate over one billion triangles in less than 3 minutes, while the single-node performance is comparable to that of the fastest to our knowledge sequential guaranteed quality Delaunay meshing library (the Triangle).