title: A counterexample to a diameter algorithm for convex polygons.
abstract: 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.
authors.affiliation: School of Computer Science, McGill University, Montreal, P.Q., Canada.
authors.forename: B K
authors.initials: BK
authors.lastname: Bhattacharya
authors.forename: G T
authors.initials: GT
authors.lastname: Toussaint