A Counterexample to a Diameter Algorithm for Convex Polygons

DOI10.1109/TPAMI.1982.4767248zbMath0477.68075WikidataQ52723829 ScholiaQ52723829MaRDI QIDQ3933768

Godfried T. Toussaint, Binay K. Bhattacharya

Publication date: 1982

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

zbMATH Keywords

image processingconvex hullcomputational geometryscene analysisregion growing

Mathematics Subject Classification ID

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

Related Items

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, Complexity, convexity, and unimodality, On the multimodality of distances in convex polygons