A linear time algorithm for obtaining the convex hull of a simple polygon

DOI10.1016/0031-3203(83)90075-4zbMath0518.52005OpenAlexW1981260651MaRDI 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

zbMATH Keywords

computational complexityconvex polygonsimple polygonordered crossing polygonconvex hull algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Algorithms in computer science (68W99) Polytopes and polyhedra (52Bxx)

Related Items (3)

Finding the convex hull of a simple polygon in linear time ⋮ Approximate polytope ensemble for one-class classification ⋮ A linear time algorithm for computing the convex hull of an ordered crossing polygon

Cites Work

• A linear algorithm for finding the convex hull of a simple polygon
• On finding the convex hull of a simple polygon
• Measuring Concavity on a Rectangular Mosaic
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear time algorithm for obtaining the convex hull of a simple polygon