A Counterexample to a Diameter Algorithm for Convex Polygons
From MaRDI portal
Publication:3933768
DOI10.1109/TPAMI.1982.4767248zbMath0477.68075WikidataQ52723829 ScholiaQ52723829MaRDI QIDQ3933768
Binay K. Bhattacharya, Godfried T. Toussaint
Publication date: 1982
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68T10: Pattern recognition, speech recognition
52A10: Convex sets in (2) dimensions (including convex curves)
68R99: Discrete mathematics in relation to computer science
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, On the multimodality of distances in convex polygons, Complexity, convexity, and unimodality