Matrix searching with the shortest path metric

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 485-494

  Hershberger, John ^a   Suri, Subhash ^b  

^a DEC/SRC ^*  (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; AUTOMATA THEORY; COMPUTATIONAL METHODS; CRITICAL PATH ANALYSIS; GEODESY; GEOMETRY; MATRIX ALGEBRA;

LINEAR-TIME ALGORITHMS; MATRIX SEARCHING; N-MATRIX; SHORTEST PATH; SIMPLE POLYGON; TIME ALGORITHMS; VERTEX PAIRS;

MATRIX ALGEBRA; ALGORITHMS;

GEODESIC DISTANCE; LINEAR TIME ALGORITHMS; MATRIX SEARCHING ALGORITHM; SHORTEST PATH METRIC;

EID: 0027225070     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167220     Document Type: Conference Paper

References (17)

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 Applied Mathematics, 31:97-111, 1991.
2. A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari. Optimal time bounds for some proximity problems in the plane. Information Processing Letters, 42:55-60, 1992.
3. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix searching algorithm. Algorithmica, 2:195-208, 1987.
4. 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, pages 115-134. Springer-Verlag, 1989.
5. L. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. Journal of Computer and System Sciences, 39(2):126-152, 1989.
6. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan. Linear time algorithms for visibil-ity and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
7. L. Guibas, J. Hershberger, and J. Snoeyink. Compact interval trees: A data structure for convex hulls. International Journal of Computational Geometry & Applications, 1(1):1-22, 1991.
8. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, 1984.
9. J. Hershberger. A new data structure for shortest path queries in a simple polygon. Information Processing Letters, 38:231-235, 1991.
10. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. In Proceedings of the 2nd Workshop on Algorithms and Data Structures, pages 331-342. Springer- Verlag, 1991. Lecture Notes in Computer Science 519.
11. A. Lingas. Voronoi diagrams with barriers and the shortest diagonal problem. Information Processing Letters, 32(4):191-198, 1989.
12. Marcotte and S. Suri. Fast matching algorithms for points on a polygon. SIAM Journal on Com-puting, 20:405-422, 1991.
13. J. O'Rourke. Computational geometry column 8. SIGACT News, 20(4):30, 1989.
14. M. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23:166-204, 1981.
15. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. In Proceedings of the Third Aegean Workshop on Computing, pages 111-123. Springer-Verlag, 1988. Lecture Notes in Computer Science 319.
16. S. Suri. Computing geodesic furthest neighbors in simple polygons. Journal of Computer and System Sciences, 39:220-235, 1989.
17. B. Zhu. Computing the shortest diagonal of a monotone polygon in linear time. Information Processing Letters, 42:303-307, 1992.