A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
From MaRDI portal
Publication:4889509
DOI10.1142/S0218195996000162zbMath0854.68039MaRDI QIDQ4889509
Uzi Vishkin, Omer Berkman, Baruch Schieber
Publication date: 12 August 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195996000162
68W15: Distributed algorithms
Related Items
Optimal parallel algorithms for proximate points, with applications, Techniques and Open Questions in Computational Convex Analysis, Fast randomized parallel methods for planar convex hull construction, Recursion and parallel algorithms in geometric modeling problems