School of Computer Science, McGill University, Montreal, P.Q., Canada.
IEEE Trans Pattern Anal Mach Intell. 1982 Mar;4(3):306-9. doi: 10.1109/tpami.1982.4767248.
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.
最近,Snyder 和 Tang [1] 提出了一种求凸多边形直径的算法。本文给出了一类其算法失效的凸多边形。同时指出,任意简单的 n 顶点多边形的直径可以在 O(n)时间内计算。