Approximation algorithms for convex hulls
From MaRDI portal
Publication:3919102
DOI10.1145/358315.358392zbMath0466.68059MaRDI QIDQ3919102
Franco P. Preparata, Jon Louis Bentley, Mark G. Faust
Publication date: 1982
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358315.358392
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
52A10: Convex sets in (2) dimensions (including convex curves)
68R99: Discrete mathematics in relation to computer science
68W99: Algorithms in computer science
Related Items
On computing approximate convex hulls, A linear time algorithm for computing the convex hull of an ordered crossing polygon, An efficient and numerically correct algorithm for the 2D convex hull problem, A note on approximate convex hulls, Approximating the diameter of a set of points in the Euclidean space, Fast geometric approximation techniques and geometric embedding problems, An approximate algorithm for computing multidimensional convex hulls, On the number of clusters, A new active convex hull model for image regions, Special cases of travelling salesman problems and heuristics