Optimal, output-sensitive algorithms for constructing planar hulls in parallel
From MaRDI portal
Publication:1367171
DOI10.1016/S0925-7721(97)00009-6zbMath0881.68123MaRDI QIDQ1367171
Publication date: 16 February 1998
Published in: Computational Geometry (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Related Items
Distribution-sensitive algorithms, Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems, Techniques and Open Questions in Computational Convex Analysis, Unnamed Item
Cites Work
- Optimal parallel algorithms for computing convex hulls and for sorting
- A deterministic view of random sampling and its use in geometry
- An optimal parallel algorithm for linear programming in the plane
- \(\epsilon\)-nets and simplex range queries
- Parallel algorithms for some functions of two convex polygons
- An optimally efficient selection algorithm
- Parallel computational geometry
- Parallel construction of subdivision hierarchies
- Output-sensitive results on convex hulls, extreme points, and related problems
- Applications of random sampling in computational geometry. II
- Lower bounds for maximal and convex layers problems
- An efficient algorithm for determining the convex hull of a finite planar set
- The Ultimate Planar Convex Hull Algorithm?
- 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
- An optimal real-time algorithm for planar convex hulls
- Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
