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

DOI10.1016/0167-8655(83)90028-4zbMATH Open0518.68051OpenAlexW1982692688WikidataQ124980111 ScholiaQ124980111MaRDI QIDQ3667966FDOQ3667966

Authors: Godfried 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 recognitioncomputational geometryconvex hullmonotone hullsimple polygonsmaximal polygons

Mathematics Subject Classification ID

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

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3667966)