Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems

Geometric partitioning made easier, even in parallel

SCG '93 Proceedings of the ninth annual symposium on Computational geometry

Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems

SCG '94 Proceedings of the tenth annual symposium on Computational geometry

On computing Voronoi diagrams by divide-prune-and-conquer

Proceedings of the twelfth annual symposium on Computational geometry

Faster output-sensitive parallel convex hulls for d≤3: optimal sublogarithmic algorithms for small outputs

Proceedings of the twelfth annual symposium on Computational geometry

Construction of 1-d lower envelopes and applications

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry

Randomized external-memory algorithms for some geometric problems

Proceedings of the fourteenth annual symposium on Computational geometry

Randomized fully-scalable BSP techniques for multi-searching and convex hull construction

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium

A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing

A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures

Parallel Convex Hull Computation by Generalised Regular Sampling

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science

Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima

Journal of Parallel and Distributed Computing

Sigma-local graphs

Journal of Discrete Algorithms

Applications of Geometry Processing: CudaHull: Fast parallel 3D convex hull on the GPU

Computers and Graphics

Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers

Theory of Computing Systems