On the conditions for success of Sklansky's convex hull algorithm

DOI10.1016/0031-3203(83)90074-2zbMath0518.52004OpenAlexW1967454815MaRDI QIDQ1053994

Marian Orlowski

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

zbMATH Keywords

computational complexitysimple polygonconvex hull, algorithmexternally left divisible polygons

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 (2)

Finding the convex hull of a simple polygon in linear time ⋮ A convex hull algorithm for planar simple polygons

Cites Work

• Unnamed Item
• 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

This page was built for publication: On the conditions for success of Sklansky's convex hull algorithm