Yi Zhou, Parikshit Ram, et al.
ICLR 2023
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.
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
George Markowsky
J. Math. Anal. Appl.
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications