Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
From MaRDI portal
Publication:4016909
Recommendations
- A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers
- Optimal randomized parallel algorithms for computational geometry
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane
- New parallel algorithms for convex hull and triangulation in 3-dimensional space
Cited in
(21)- RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- Computational Science and Its Applications – ICCSA 2004
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Optimal randomized parallel algorithms for computational geometry
- scientific article; zbMATH DE number 1419216 (Why is no real title available?)
- Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima.
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel
- scientific article; zbMATH DE number 2090610 (Why is no real title available?)
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
- THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
- Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
- Parallelism in randomized incremental algorithms
- Sigma-local graphs
- New parallel algorithms for convex hull and triangulation in 3-dimensional space
- scientific article; zbMATH DE number 761263 (Why is no real title available?)
- An optimal convex hull algorithm in any fixed dimension
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
This page was built for publication: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016909)