A counterexample to an algorithm for computing monotone hulls of simple polygons

DOI10.1016/0167-8655(83)90028-4zbMath0518.68051OpenAlexW1982692688WikidataQ124980111 ScholiaQ124980111MaRDI QIDQ3667966

Godfried T. Toussaint, Hossam ElGindy

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0167-8655(83)90028-4

zbMATH Keywords

pattern recognitionconvex hullsimple polygonscomputational geometrymonotone hullmaximal polygons

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (4)

Finding the convex hull of a simple polygon in linear time ⋮ OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS ⋮ The two variable per inequality abstract domain ⋮ On finding the convex hull of a simple polygon

This page was built for publication: A counterexample to an algorithm for computing monotone hulls of simple polygons