Computing geodesic furthest neighbors in simple polygons

Citations of this article
Mendeley users who have this article in their library.


An algorithm is presented for computing geodesic furthest neighbors for all the vertices of a simple polygon, where geodesic denotes the fact that distance between two points of the polygon is defined as the length of an Euclidean shortest path connecting them within the polygon. The algorithm runs in O(n log n) time and uses O(n) space; n being the number of vertices of the polygon. As a corollary, the geodesic diameter of the polygon also can be computed within, the same time and space bounds. © 1989.




Suri, S. (1989). Computing geodesic furthest neighbors in simple polygons. Journal of Computer and System Sciences, 39(2), 220–235.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free