Finding the convex hull of a simple polygon

DOI10.1016/0167-8655(82)90016-2zbMath0492.68056MaRDI QIDQ5905193

Jack Sklansky

Publication date: 1982

Published in: Pattern Recognition Letters (Search for Journal in Brave)

zbMATH Keywords

pattern recognitioncomputational geometry

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) Pattern recognition, speech recognition (68T10) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)

Related Items (3)

Finding the convex hull of a simple polygon in linear time ⋮ On finding the convex hull of a simple polygon ⋮ Applications of a two-dimensional hidden-line algorithm to other geometric problems

This page was built for publication: Finding the convex hull of a simple polygon