Finding the Convex Hull of Discs in Parallel
From MaRDI portal
Publication:4513213
DOI10.1142/S0218195998000151zbMath1035.68525MaRDI QIDQ4513213
Koichi Wada, Danny Z. Chen, Wei Chen, Kimio Kawaguchi
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Optimal merging and sorting on the EREW PRAM
- A sublogarithmic convex hull algorithm
- Parallel algorithms for some functions of two convex polygons
- Finding the convex hull of a sorted point set in parallel
- Parallel computational geometry
- Optimal parallel algorithms for point-set and polygon problems
- A convex hull algorithm for discs, and applications
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- A Lower Bound to Finding Convex Hulls