A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Computing external farthest neighbors for a simple polygon
1991
Discrete Applied Mathematics
Agarwal, P.K., A. Aggarwal, B. Aronov, S.R. Kosaraju, B. Schieber and S. Suri, Computing external farthest neighbors for a simple polygon, Discrete Applied Mathematics 31 (1991) 97-l 11. Let .+' be (the boundary of) a simple polygon with n vertices. For a vertex p of Y, let @J(P) be the set of points on :sP that are farthest fromp, where the distance between two points is the length of the (Euclidean) shortest path that connects them without intersecting the interior of Y. In this paper, we
doi:10.1016/0166-218x(91)90063-3
fatcat:klzdgk6rlbbjzhc2dx3u6cnotq