Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems

DOI10.1137/0221031zbMath0761.68100OpenAlexW4238964467MaRDI QIDQ4016909

Sandeep Sen, John H. Reif

Publication date: 16 January 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0221031

zbMATH Keywords

randomizationparallel algorithmsconvex-hulls

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

A time-optimal parallel algorithm for three-dimensional convex hulls ⋮ Optimal, output-sensitive algorithms for constructing planar hulls in parallel ⋮ Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems ⋮ Sigma-local graphs ⋮ RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS ⋮ A nearly optimal deterministic parallel Voronoi diagram algorithm

This page was built for publication: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems