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

DOI10.1016/0020-0190(78)90041-8zbMath0365.68028OpenAlexW2040465510MaRDI QIDQ1241280

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)

Related Items

Convex hull of planarh-polyhedra ⋮ Another efficient algorithm for convex hulls in two dimensions ⋮ The two variable per inequality abstract domain ⋮ A fast convex hull algorithm ⋮ Some performance tests of convex hull algorithms

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