Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
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.
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis