Optimal shortest path and minimum-link path queries between two convex polygons inside a simple polygonal obstacle

International Journal of Computational Geometry and Applications

Volumn 7, Issue 1-2, 1997, Pages 85-121

  Chiang, Yi Jen ^a   Tamassia, Roberto ^a  

^a Brown Univerity   (United States)

Author keywords

Analysis of algorithms; Computational geometry; Minimum link path; Shortest path; Static and dynamic data structures

Indexed keywords

EID: 0031504214     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195997000077     Document Type: Article

References (10)

1. Nancy M. Amato. An optimal algorithm for finding the separation of simple polygons. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 48-59. Springer-Verlag, 1993.
2. E. M. Arkin, J. S. B. Mitchell, and S. Suri. Optimal link path queries in a simple polygon. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 269-279, 1992.
3. V. Chandru, S. K. Ghosh, A. Maheshwari, V. T. Rajan, and S. Saluja. NC-algorithms for minimum link path and related problems. Technical Report CS-90/3, TATA inst., Bombay, India, 1990.
4. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485-524, 1991.
5. B. Chazelle and D. P. Dobkin. Intersection of convex objects in two and three dimensions. J. ACM, 34:1-27, 1987.
6. Y.-J. Chiang, F. P. Pieparata, and R, Tamassia. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 44-53, 1993.
7. F. Chin and C. A. Wang. Optimal algorithms for the intersection and the minimum distance problems between planar polygons. IEEE Trans. Comput., C-32(12):1203-1207, 1983.
8. M. de Berg. On rectilinear link distance. Comput. Geom. Theory Appl., 1(1):13-34, July 1991.
9. 1 and link metric. In Proc. 2nd Scand. Workshop Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 213-224. Springer-Verlag, 1990.
10. H. N. Djidjev, A. Lingas, and J.-R. Sack. An O(n log n) algorithm for computing the link center of a simple polygon. Discrete Comput. Geom., 8:131-152, 1992.