Finding the Convex Hull of Discs in Parallel

DOI10.1142/S0218195998000151MaRDI QIDQ4513213zbMATH OpenFDO

Authors Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen

Publication date 7 November 2000

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195998000151

zbMATH Keywords

computational geometryEREW PRAM model

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
• Finding the convex hull of a sorted point set in parallel
• A sublogarithmic convex hull algorithm
• Efficient parallel convex hull algorithms
• Fast randomized parallel methods for planar convex hull construction

Cites work

• A convex hull algorithm for discs, and applications
• A Lower Bound to Finding Convex Hulls
• A sublogarithmic convex hull algorithm
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• Finding the convex hull of a sorted point set in parallel
• Optimal merging and sorting on the EREW PRAM
• Optimal parallel algorithms for point-set and polygon problems
• Parallel algorithms for some functions of two convex polygons
• Parallel computational geometry

Cited in

(3)

• A convex hull algorithm for discs, and applications
• Robust algorithms for constructing strongly convex hulls in parallel.
• QuickhullDisk: a faster convex hull algorithm for disks

This page was built for publication: Finding the Convex Hull of Discs in Parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513213)