A time-optimal parallel algorithm for three-dimensional convex hulls
From MaRDI portal
Publication:1899449
DOI10.1007/BF01293667zbMath0833.68056MaRDI QIDQ1899449
Franco P. Preparata, Nancy M. Amato
Publication date: 11 March 1996
Published in: Algorithmica (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel algorithms for some functions of two convex polygons
- Parallel computational geometry
- Parallel construction of subdivision hierarchies
- Another efficient algorithm for convex hulls in two dimensions
- Applications of random sampling in computational geometry. II
- Optimal cooperative search in fractional cascaded data structures
- Probabilistic parallel prefix computation
- An efficient algorithm for determining the convex hull of a finite planar set
- An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
- The Ultimate Planar Convex Hull Algorithm?
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Optimal Point Location in a Monotone Subdivision
- Parallel Merge Sort
- Efficient parallel convex hull algorithms
- Parallel Transitive Closure and Point Location in Planar Structures
- Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
- THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
- Convex hulls of finite sets of points in two and three dimensions
- Location of a Point in a Planar Subdivision and Its Applications
This page was built for publication: A time-optimal parallel algorithm for three-dimensional convex hulls
