On the conditions for success of Sklansky's convex hull algorithm
From MaRDI portal
Publication:1053994
DOI10.1016/0031-3203(83)90074-2zbMath0518.52004MaRDI QIDQ1053994
Publication date: 1983
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0031-3203(83)90074-2
computational complexity; simple polygon; convex hull, algorithm; externally left divisible polygons
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
52Bxx: Polytopes and polyhedra
Related Items
A convex hull algorithm for planar simple polygons, Finding the convex hull of a simple polygon in linear time
Cites Work