Further comments on Bykat's convex hull algorithm

DOI10.1016/0020-0190(80)90142-8zbMath0449.68030OpenAlexW2118739732MaRDI QIDQ1147518

Jan van Leeuwen, Mark H. Overmars

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/24409

zbMATH Keywords

Bykat's convex hull algorithmexpected time complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Convex-hull algorithms: implementation, testing, and experimentation

Cites Work

• Another efficient algorithm for convex hulls in two dimensions
• Convex hull of a finite set of points in two dimensions
• Divide and conquer for linear expected time
• A New Convex Hull Algorithm for Planar Sets
• Comments on convex hull of a finite set of points in two dimensions
• Comments on convex hull of a finite set of points in two dimensions

This page was built for publication: Further comments on Bykat's convex hull algorithm