A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET

DOI10.1142/S0218195996000162zbMath0854.68039OpenAlexW2104304525MaRDI 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

zbMATH Keywords

parallel algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (4)

Optimal parallel algorithms for proximate points, with applications ⋮ Recursion and parallel algorithms in geometric modeling problems ⋮ Fast randomized parallel methods for planar convex hull construction ⋮ Techniques and Open Questions in Computational Convex Analysis

This page was built for publication: A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET