Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
Let P be (the boundary of) a simple polygon with n vertices. For a vertex p of P, let φ{symbol}(p) be the set of points on P that are farthest from p, where the distance between two points is the length of the (Euclidean) shortest path that connects them without intersecting the interior of P. In this paper, we present an O(n log n) algorithm to compute a member of φ{symbol}(p) for every vertex p of P. As a corollary, the external diameter of P can also be computed in the same time. © 1991.
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991