A Counterexample to a Diameter Algorithm for Convex Polygons
Binay Kumar Bhattacharya, Godfried T. Toussaint · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1982
Recently, Snyder and Tang [1] proposed an algorithm for finding the diameter of a convex polygon. In this note a family of convex polygons is described for which their algorithm fails. It is also pointed out that the diameter of an arbitrary simple n-vertex polygon can be computed in O(n) time.