An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon

International Journal of Computational Geometry and Applications

Volumn 6, Issue 2, 1996, Pages 205-225

  Schuierer, Sven ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

L1 metric; Rectilinear link metric; Shortest path query; Simple rectilinear polygons

Indexed keywords

EID: 0030547338     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000149     Document Type: Article

References (24)

1. P. Widmayer, "On Shortest Paths in VLSI design", Technical Report 19, Institut für Informatik, Universität Freiburg, Germany, 1990.
2. 2 n) time", Proc. 3rd Annual Symposium on Computational Geometry, Waterloo, Ont., 1987, pp. 251-257.
3. P.J. de Rezende, D.T. Lee, and Y.F. Wu, "Rectilinear shortest paths with rectangular barriers", Journal of Discrete and Computational Geometry, 4 (1989) 41-53.
4. R.C. Larson and V.O. Li, "Finding minimum rectilinear distance paths in the presence of barriers", Networks, 11 (1981) 285-304.
5. G. Das and G. Narasimhan, "Geometric searching and link distance", in Algorithms and Data Structures, Proc. 2nd Workshop on Algorithms and Data Structures, WADS'91, eds. F. Dehne, J.-R. Sack, F. Santoro, (Springer Verlag, Heidelberg, 1991) pp. 261-272.
6. C. D. Yang, D. T. Lee, and C. K. Wong, "On bends and lengths of rectilinear paths: a graph-theoretic approach", in Algorithms and Data Structures, Proc. 2nd Workshop on Algorithms and Data Structures, WADS'91, eds. F. Dehne, J.-R. Sack, F. Santoro (Springer Verlag, Heidelberg, 1991) pp. 320-330.
7. 1 and link metric", in SWAT'90, Proc. 2nd Scandinavian Workshop on Algorithm Theory, eds. J.R. Gilbert R. Karlsson (Springer Verlag, Heidelberg, 1990) pp. 213-224.
8. M. Atallah and D. Chen, "On parallel rectilinear obstacle-avoiding paths", Proc. 5th Canadian Conference on Computational Geometry, Waterloo, Ont., Aug. 1993, pp. 210-215.
9. H. ElGindy and P. Mitra, "Orthogonal shortest route queries among axes parallel rectangular obstacles", Technical Report No. SOCS 91.07 (July 1991), School of Computer Science, McGill University.
10. M. de Berg, "On rectilinear link distance", Computational Geometry: Theory and Applications, 1 (1991) 13-34.
11. J. Hershberger and J. Snoeyink, "Computing minimum length paths of a given homotopy class", in Algorithms and Data Structures, Proc. 2nd Workshop on Algorithms and Data Structures, WADS'91, eds. F. Dehne, J.-R. Sack, F. Santoro, (Springer Verlag, Heidelberg, 1991), pp. 331-342.
12. A. Ferreira and J. Peters, "Finding smallest paths in rectilinear polygons on a hypercube multiprocessor", Proc. 3rd Canadian Conference on Computational Geometry, Vancouver, B.C., Aug. 1991, pp. 162-165.
13. K. McDonalds and J. Peters. "Smallest Paths in Simple Rectilinear Polygons". IEEE Transactions on Computer Aided Design 11, 1992, pp. 864-875.
14. L. Guibas and J. Hershberger, "Optimal shortest path queries in a simple polygon", Journal of Computer Systems and Science, 39 (1989), pp. "50-63".
15. E. Alkin, J. Mitchell, and S. Suri, "Optimal link path queries in a simple polygon", In Proc. 3rd Symposium on Discrete Algorithms, Jan. 1992, pp. 269-279.
16. Christos Levcopoulos, "Heuristics for Minimum Decompositions of Polygons", PhD thesis, University of Linköping, Sweden, 1987.
17. Bernard Chazelle, "Triangulating a simple polygon in linear time", Discrete & Computational Geometry, 6 1991, 485-524.
18. H. Edelsbrunner, L.J. Guibas, and J. Stolfi, "Optimal point location in a monotone subdivision", SIAM Journal of Computing, 15 (1986) 317-340.
19. D. Harel and R. E. Tarjan, "Fast algorithms for finding nearest common ancestors", SIAM Journal on Computing, 13 (1984) 338-355.
20. B. Schieber and U. Vishkin, "On finding lowest common ancestors: simplification and parallelization", SIAM Journal of Computing, 17 (1988) 1253-1262.
21. O. Berkman and U. Vishkin, "Recursive*-tree parallel data-structure", Proc. 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, Oct. 1989, pp. 196-202.
22. B.J. Nilsson and S. Schuierer. Computing the rectilinear link diameter of a polygon. In Computational Geometry-Methods, Algorithms, and Applications, Proc. Int. Workshop on Computational Geometry CG'91, eds. H. Bieri H. Noltemeier (Springer Verlag, Heidelberg, 1991) pp. 203-216.
23. S. Schuierer. An Optimal Algorithm to Compute the Li-Diameter and Center of a Simple Rectilinear Polygon. Technical Report 49, Institut für Informatik, Universität Freiburg, 1994.
24. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, "Geometric applications of a matrix searching technique", Algorithmica, 2 (1987) 195-208.