Computing geodesic properties inside a simple polygon
Godfried T. Toussaint · 1989
Suri, S., "Minimum link paths in polygons and related problems," Ph.D. thesis, The Johns Hopkins University, August 1987. [Su87b] Suri, S., "The all-geodesic-furthest neighbors problem for simple polygons," Proc. Third Annual ACM Symposium on Computational Geometry, University of Waterloo, June 1987, pp. 64-75. [Su86a] Suri, S., "Computing the geodesic diameter of a simple polygon," Tech. Rept. JHUEECS -86-08, Johns Hopkins University, 1986. [Su86b] Suri, S., "A linear time algorithm for minimum link paths inside a simple polygon," Computer Vision, Graphics, and Image Processing, Vol. 35, 1986, pp. 99-110. [To85] Toussaint, G. T., "A historical note on convex hull finding algorithms," Pattern Recognition Letters, Vol. 3., January 1985, pp. 21-28. [To86a] Toussaint, G. T., "Shortest path solves edge-to-edge visibility in a polygon," Pattern Recognition Letters, Vol. 4, July 1986, pp. 165-170. [To86b] Toussaint, G. T., "A lin