Fast randomized parallel methods for planar convex hull construction

DOI10.1016/0925-7721(95)00036-4zbMath0878.68126OpenAlexW2018318565MaRDI QIDQ676065

Mujtaba R. Ghouse, Michael T. Goodrich

Publication date: 4 January 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00036-4

zbMATH Keywords

parallel algorithmsfailure sweeping

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items

Locating two obnoxious facilities using the weighted maximin criterion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal merging and sorting on the EREW PRAM
• Finding an approximate median with high probability in constant parallel time
• A guided tour of Chernoff bounds
• An optimal parallel algorithm for linear programming in the plane
• Parallel algorithms for some functions of two convex polygons
• Finding the convex hull of a sorted point set in parallel
• Parallel computational geometry
• Derandomizing an output-sensitive convex hull algorithm in three dimensions
• Constructing the convex hull of a partially sorted set of points
• An efficient algorithm for determining the convex hull of a finite planar set
• The Ultimate Planar Convex Hull Algorithm?
• Efficient parallel convex hull algorithms
• A Lower Bound to Finding Convex Hulls
• A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations