Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
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
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the Radius-Edge Condition in the Control Volume Method
SIAM Journal on Numerical Analysis
Smoothing and cleaning up slivers
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Generating well-shaped Delaunay meshed in 3D
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains
Proceedings of the eighteenth annual symposium on Computational geometry
Generating well-shaped d-dimensional Delaunay meshes
Theoretical Computer Science - Computing and combinatorics
Time complexity of practical parallel steiner point insertion algorithms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Parallel delaunay refinement mesh generation
Parallel delaunay refinement mesh generation
A time-optimal delaunay refinement algorithm in two dimensions
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Proceedings of the 19th annual international conference on Supercomputing
Scalable Parallel Octree Meshing for TeraScale Applications
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
Sliver removal by lattice refinement
Proceedings of the twenty-second annual symposium on Computational geometry
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
Optimistic parallelism benefits from data partitioning
Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
How much parallelism is there in irregular applications?
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Optimistic parallelism requires abstractions
Communications of the ACM - The Status of the P versus NP Problem
Towards a science of parallel programming
Proceedings of the 19th international conference on Parallel architectures and compilation techniques
A pattern language for parallelizing irregular algorithms
Proceedings of the 2010 Workshop on Parallel Programming Patterns
Parallelism in dynamic well-spaced point sets
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
The tao of parallelism in algorithms
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Beating the spread: time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry
PLDS: Partitioning linked data structures for parallelism
ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
A CPU-GPU framework for optimizing the quality of large meshes
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The authors recently introduced the technique of sparse mesh refinement to produce the first near-optimal sequential time bounds of O(n lg L/s+m) for inputs in any fixed dimension with piecewiselinear constraining (PLC) features. This paper extends that work to the parallel case, refining the same inputs in time O(lg(L/s) lgm) on an EREW PRAM while maintaining the work bound; in practice, this means we expect linear speedup for any practical number of processors. This is faster than the best previously known parallel Delaunay mesh refinement algorithms in two dimensions. It is the first technique with work bounds equal to the sequential case. In higher dimension, it is the first provably fast parallel technique for any kind of quality mesh refinement with PLC inputs. Furthermore, the algorithm's implementation is straightforward enough that it is likely to be extremely fast in practice.