Further comments on Bykat's convex hull algorithm

DOI10.1016/0020-0190(80)90142-8MaRDI QIDQ1147518zbMATH OpenOpenAlexFDO

Authors Mark H. Overmars, J. Van Leeuwen

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) Discrete mathematics in relation to computer science (68R99) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites work

• A New Convex Hull Algorithm for Planar Sets
• Another efficient algorithm for convex hulls in two dimensions
• 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
• Convex hull of a finite set of points in two dimensions
• Divide and conquer for linear expected time

Cited in

(1)

• Convex-hull algorithms: implementation, testing, and experimentation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147518)