Matrix searching with the shortest-path metric

SIAM Journal on Computing

Volumn 26, Issue 6, 1997, Pages 1612-1634

  Hershberger, John ^a   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b WASHINGTON UNIVERSITY   (United States)

Author keywords

Farthest neighbors; Geodesic diameter; Geometric matching; Matrix searching; Shortest paths

Indexed keywords

EID: 0008852487     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793253577     Document Type: Article

References (16)

1. P. K. AGARWAL, A. AGGARWAL, B. ARONOV, S. R. KOSARAJU, B. SCHIEBER, AND S. SURI, Computing external-furthest neighbors for a Simple polygon, Discrete Appl. Math., 31 (1991), pp. 97-111.
2. A. AGGARWAL, M. KLAWE, S. MORAN, P. SHOR, AND R. WILBER, Geometric applications of a matrix searching algorithm, Algorithmica, 2 (1987), pp. 195-208.
3. A. AGGARWAL, S. MORAN, P. SHOR, AND S. SURI, Computing the minimum visible vertex distance between two polygons, in Proc. of 1st Workshop on Algorithms and Data Structures, Springler-Verlag, New York, 1989, pp. 115-134.
4. N. M. AMATO, Finding a closest visible vertex pair between two polygons, Algorithmica, 14 (1995), pp. 183-201.
5. B. CHAZELLE, Triangulating a simple polygon in linear time, Discrete Comput. Geom., 6 (1991), pp. 485-524.
6. L. GUIBAS AND J. HERSHBERGER, Optimal shortest path queries in a simple polygon, J. Comput. System Sci., 39 (1989), pp. 126-152. Special issue of selected papers from the 3rd Annual ACM Symposium on Computational Geometry, 1987.
7. L. GUIBAS, J. HERSHBERGER, D. LEVEN, M. SHARIR, AND R. TARJAN, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2 (1987), pp. 209-233.
8. L. GUIBAS, J. HERSHBERGER, AND J. SNOEYINK, Compact interval trees: A data structure for convex hulls, Internat. J. Comput. Geom. Appl., 1 (1991), pp. 1-22.
9. D. HAREL AND R. E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
10. J. HERSHBERGER, A new data structure for shortest path queries in a simple polygon, Inform. Process. Lett., 38 (1991), pp. 231-235.
11. J. HERSHBERGER AND J. SNOEYINK, Computing minimum length paths of a given homotopy class, Comput. Geom., 4 (1994), pp. 63-97.
12. J. HERSHBERGER AND S. SURI, Finding a shortest diagonal of a simple polygon in linear time, Comput. Geom., 7 (1997), pp. 149-204.
13. O. MARCOTTE AND S. SURI, Fast matching algorithms for points on a polygon, SIAM J. Comput., 20 (1991), pp. 405-422.
14. M. OVERMARS AND J. VAN LEEUWEN, Maintenance of configurations in the plane, J. Comput. System Sci., 23 (1981), pp. 166-204.
15. B. SCHIEBER AND U. VISHKIN, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput., 17 (1988), pp. 1253-1262.
16. S. SURI, Computing geodesic furthest neighbors in simple polygons, J. Comput. System Sci., 39 (1989), pp. 220-235.