Optimal, output-sensitive algorithms for constructing planar hulls in parallel
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 437523 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1256701 (Why is no real title available?)
- scientific article; zbMATH DE number 2077121 (Why is no real title available?)
- scientific article; zbMATH DE number 910884 (Why is no real title available?)
- A deterministic view of random sampling and its use in geometry
- An efficient algorithm for determining the convex hull of a finite planar set
- An optimal parallel algorithm for linear programming in the plane
- An optimal real-time algorithm for planar convex hulls
- An optimally efficient selection algorithm
- Applications of random sampling in computational geometry. II
- Convex hulls of finite sets of points in two and three dimensions
- Lower bounds for maximal and convex layers problems
- Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
- Optimal parallel algorithms for computing convex hulls and for sorting
- Output-sensitive results on convex hulls, extreme points, and related problems
- Parallel algorithms for some functions of two convex polygons
- Parallel computational geometry
- Parallel construction of subdivision hierarchies
- Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
- THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
- The Ultimate Planar Convex Hull Algorithm?
- -nets and simplex range queries
Cited in
(13)- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- Computational Science and Its Applications – ICCSA 2004
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
- Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel
- An output sensitive algorithm for discrete convex hulls
- Comments on two parallel algorithms for the planar convex hull problem
- Fast randomized parallel methods for planar convex hull construction
- scientific article; zbMATH DE number 2081104 (Why is no real title available?)
- Techniques and open questions in computational convex analysis
- Synergistic solutions for merging and computing planar convex hulls
- scientific article; zbMATH DE number 7561401 (Why is no real title available?)
- Distribution-sensitive algorithms
- Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima.
This page was built for publication: Optimal, output-sensitive algorithms for constructing planar hulls in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367171)
