A time-optimal parallel algorithm for three-dimensional convex hulls
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3759279 (Why is no real title available?)
- scientific article; zbMATH DE number 177829 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
- An efficient algorithm for determining the convex hull of a finite planar set
- Another efficient algorithm for convex hulls in two dimensions
- Applications of random sampling in computational geometry. II
- Convex hulls of finite sets of points in two and three dimensions
- Efficient parallel convex hull algorithms
- Location of a Point in a Planar Subdivision and Its Applications
- Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
- Optimal Point Location in a Monotone Subdivision
- Optimal cooperative search in fractional cascaded data structures
- Parallel Merge Sort
- Parallel Transitive Closure and Point Location in Planar Structures
- Parallel algorithms for some functions of two convex polygons
- Parallel computational geometry
- Parallel construction of subdivision hierarchies
- Probabilistic parallel prefix computation
- THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
- The Ultimate Planar Convex Hull Algorithm?
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
Cited in
(17)- A BSP realisation of Jarvis' algorithm
- New parallel algorithms for convex hull and triangulation in 3-dimensional space
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
- scientific article; zbMATH DE number 4062600 (Why is no real title available?)
- scientific article; zbMATH DE number 2090610 (Why is no real title available?)
- THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
- Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
- scientific article; zbMATH DE number 761263 (Why is no real title available?)
- Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
- Parallel construction of subdivision hierarchies
- gHull, a GPU algorithm for 3D convex hull
- Sigma-local graphs
- A parallel algorithm for constructing projection polyhedra
- Fast computing of three-dimensional convex hulls using graphics hardware
- Finding the convex hull of a sorted point set in parallel
- Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima.
This page was built for publication: A time-optimal parallel algorithm for three-dimensional convex hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899449)
