A linear time algorithm for obtaining the convex hull of a simple polygon
From MaRDI portal
Publication:1053995
DOI10.1016/0031-3203(83)90075-4zbMath0518.52005MaRDI QIDQ1053995
Subir Kumar Ghosh, Rudrapatna K. Shyamasundar
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)90075-4
computational complexity; convex polygon; simple polygon; ordered crossing polygon; convex hull algorithm
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 linear time algorithm for computing the convex hull of an ordered crossing polygon, Finding the convex hull of a simple polygon in linear time
Cites Work