A fast convex hull algorithm
From MaRDI portal
Publication:1251805
DOI10.1016/0020-0190(78)90003-0zbMath0392.52003MaRDI QIDQ1251805
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)90003-0
68Q25: Analysis of algorithms and problem complexity
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
52A10: Convex sets in (2) dimensions (including convex curves)
68W99: Algorithms in computer science
Related Items
Randomized quickhull, Finite nondense point set analysis, Computing the convex hull in a hammock, An approximate algorithm for computing multidimensional convex hulls, Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\), Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points