A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Construction of three-dimensional Delaunay triangulations using local transformations
Computer Aided Geometric Design
Parallel unstructured grid generation
Unstructured scientific computation on scalable multiprocessors
Robust adaptive floating-point geometric predicates
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
Proceedings of the fourteenth annual symposium on Computational geometry
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Mesh generation for domains with small angles
Proceedings of the sixteenth annual symposium on Computational geometry
A point-placement strategy for conforming Delaunay tetrahedralization
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Mobile object layer: a runtime substrate for parallel adaptive and irregular computations
Advances in Engineering Software - Special issue on large-scale analysis, design and intelligent synthesis environments
Simultaneous mesh generation and partitioning for Delaunay meshes
Mathematics and Computers in Simulation - IMACS sponsored special issue: 1999 international symposium on computational sciences, to honor John R. Rice
Geometry and topology for mesh generation
Geometry and topology for mesh generation
Conforming Delaunay triangulations in 3D
Proceedings of the eighteenth annual symposium on Computational geometry
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Large-scale parallel unstructured mesh computations for 3D high-lift analysis
Large-scale parallel unstructured mesh computations for 3D high-lift analysis
Delaunay refinement mesh generation
Delaunay refinement mesh generation
Algorithm 872: Parallel 2D constrained Delaunay mesh generation
ACM Transactions on Mathematical Software (TOMS)
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
Recent advances in checkpoint/recovery systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Parallel Delaunay triangulation-Application to two dimensions
Finite Elements in Analysis and Design
Quality tetrahedral mesh smoothing via boundary-optimized Delaunay triangulation
Computer Aided Geometric Design
High quality real-time image-to-mesh conversion for finite element simulations
Proceedings of the 27th international ACM conference on International conference on supercomputing
New software developments for quality mesh generation and optimization from biomedical imaging data
Computer Methods and Programs in Biomedicine
High quality real-time Image-to-Mesh conversion for finite element simulations
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We describe a distributed memory parallel Delaunay refinement algorithm for simple polyhedral domains whose constituent bounding edges and surfaces are separated by angles between 90° to 270° inclusive. With these constraints, our algorithm can generate meshes containing tetrahedra with circumradius to shortest edge ratio less than 2, and can tolerate more than 80% of the communication latency caused by unpredictable and variable remote gather operations.Our experiments show that the algorithm is efficient in practice, even for certain domains whose boundaries do not conform to the theoretical limits imposed by the algorithm. The algorithm we describe is the first step in the development of much more sophisticated guaranteed-quality parallel mesh generation algorithms.