Computing Geodesic Furthest Neighbors in Simple Polygons *

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.

[1]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[2]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[4]  Christian Lantuéjoul,et al.  Geodesic methods in quantitative image analysis , 1984, Pattern Recognit..

[5]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[6]  Alok Aggarwal,et al.  Geometric Applications of a Matrix Searching Algorithm , 1986, Symposium on Computational Geometry.

[7]  G. Toussaint,et al.  Computing the Geodesic Center of a Simple Polygon , 1987 .

[8]  Leonidas J. Guibas,et al.  Optimal shortest path queries in a simple polygon , 1987, SCG '87.

[9]  Robert E. Tarjan,et al.  An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..

[10]  Micha Sharir,et al.  Computing the geodesic center of a simple polygon , 1989, Discret. Comput. Geom..

[11]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[12]  Leonidas J. Guibas,et al.  Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.