A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set

DOI10.1016/0020-0190(78)90041-8zbMATH Open0365.68028OpenAlexW2040465510MaRDI QIDQ1241280FDOQ1241280

Authors: Kenneth R. Anderson 

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90041-8

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites Work

• An efficient algorithm for determining the convex hull of a finite planar set
• On the identification of the convex hull of a finite set of points in the plane
• Convex hulls of finite sets of points in two and three dimensions

Cited In (6)

• Another efficient algorithm for convex hulls in two dimensions
• Convex hull of planarh-polyhedra
• A fast convex hull algorithm
• The two variable per inequality abstract domain
• Sharp inequalities involving the Cheeger constant of planar convex sets
• Some performance tests of convex hull algorithms

This page was built for publication: A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set

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