Developing a practical projection-based parallel Delaunay algorithm

Computational geometry: an introduction

Computational geometry: an introduction

A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time

SCG '86 Proceedings of the second annual symposium on Computational geometry

The ultimate planar convex hull algorithm

SIAM Journal on Computing

Polling: a new randomized sampling technique for computational geometry

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

Merging free trees in parallel for efficient Voronoi diagram construction

Proceedings of the seventeenth international colloquium on Automata, languages and programming

In-place techniques for parallel convex hull algorithms (preliminary version)

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures

An O(n log2h) time algorithm for the three-dimensional convex hull problem

SIAM Journal on Computing

An efficient expected time parallel algorithm for Voronoi construction

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation

Proceedings of the 1993 ACM/IEEE conference on Supercomputing

Implementation of a portable nested data-parallel language

Journal of Parallel and Distributed Computing - Special issue on data parallel algorithms and programming

Parallel solutions to geometric problems in the scan model of computation

Journal of Computer and System Sciences

A randomized parallel 3D convex hull algorithm for coarse grained multicomputers

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures

A comparison of sequential Delaunay triangulation algorithms

Proceedings of the eleventh annual symposium on Computational geometry

Efficient parallel algorithms for closet point problems

Efficient parallel algorithms for closet point problems

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

Primitives for the manipulation of general subdivisions and the computation of Voronoi

ACM Transactions on Graphics (TOG)

Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Parallel Prefix Computation

Journal of the ACM (JACM)