On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm

DOI10.1006/jagm.1997.0869zbMath0895.68060OpenAlexW2061532023MaRDI QIDQ4366880

Binay K. Bhattacharya, Sandeep Sen

Publication date: 27 September 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0869

zbMATH Keywords

planar convex hull problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (6)

Distribution-sensitive algorithms ⋮ Space-efficient planar convex hull algorithms ⋮ Convex-hull algorithms: implementation, testing, and experimentation ⋮ A new algorithm for computing the convex hull of a planar point set ⋮ Random convex hulls and extreme value statistics ⋮ Unnamed Item

This page was built for publication: On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm