A Counterexample to a Diameter Algorithm for Convex Polygons

DOI10.1109/TPAMI.1982.4767248MaRDI QIDQ3933768zbMATH OpenWikidataFDO

Authors Binay Bhattacharya, Godfried Toussaint

Publication date 1982

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TPAMI.1982.4767248

zbMATH Keywords

computational geometryconvex hullimage processingregion growingscene analysis

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited in

(5)

• Complexity, convexity, and unimodality
• Fast algorithms for computing the diameter of a finite planar set
• On the unimodality of convex polygons
• A simple linear-time algorithm for computing the ring and MST of unimodal polygons
• On the multimodality of distances in convex polygons

This page was built for publication: A Counterexample to a Diameter Algorithm for Convex Polygons

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