Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 51-73

  Goodrich, Michael T ^a   Tamassia, Roberto ^b  

^a Johns Hopkins University   (United States)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002996230     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1995.0797     Document Type: Article

References (25)

1. P. K. Agarwal and M. Sharir, Applications of a new partitioning scheme, in "Proceedings, 2nd Workshop Algorithms Data Structure, Lecture Notes in Computer Science," Vol. 519, pp. 379-391, Springer-Verlag, Berlin/New York, 1991.
2. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink, Ray shooting in polygons using geodesic triangulations, Algorithmica 12 (1994), 54-68.
3. B. Chazelle and L. J. Guibas, Visibility and intersection problems in plane geometry. Discrete Comput. Geom. 4 (1989), 551-581.
4. S. W. Cheng and R. Janardan, Algorithms for ray-shooting and intersection searching, J. Algorithms 13 (1992), 670-692.
5. Y.-J. Chiang, F. P. Preparata, and R. Tamassia, A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps, in "Proceedings, 4th ACM-SIAM Symposium Discrete Algorithms," pp. 44-53, 1993.
6. Y.-J. Chiang and R. Tamassia, Dynamic algorithms in computational geometry, Proc. IEEE 80(9) (1992), 1412-1434.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
8. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," EATCS Monographs on Theoretical Computer Science, Vol. 10, Springer-Verlag, Heidelberg, 1987.
9. M. Goodrich and R. Tamassia, Dynamic trees and dynamic point location, in "Proceedings, 23rd Annual ACM Symposium Theory Computing," pp. 523-533, 1991.
10. M. T. Goodrich, M. Ghouse, and J. Bright, Generalized sweep methods for parallel computational geometry, in "Proceedings 2nd ACM Symposium Parallel Algorithms Architecture," pp. 280-289, 1990.
11. L. J. Guibas and J. Hershberger, Optimal shortest path queries in a simple polygon, J. Comput. System Sci. 39 (1989), 126-152.
12. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2 (1987), 209-233.
13. L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, in "Proceedings 19th Annual IEEE Symposium Foundation Computer Science," Lecture Notes in Computer Science, pp. 8-21, 1978.
14. J. Hershberger, A new data structure for shortest path queries in a simple polygon, Inform. Process. Lett. 38 (1991), 231-235.
15. J. Hershberger, Optimal parallel algorithms for triangulated simple polygons, in "Proceedings 8th Annual ACM Symposium Computer Geometry," pp. 33-42, 1992.
16. J. Hershberger and S. Suri, A pedestrian approach to ray shooting: Shoot a ray, take a walk, in "Proceedings 4th ACM-SIAM Symposium Discrete Algorithms," pp. 54-63, 1993.
17. J. D. Lawrence, "A Catalog of Special Plane Curves," Dover, New York, 1972.
18. D. T. Lee and F. P. Preparata, Location of a point in a planar subdivision and its applications, SIAM J. Comput 6 (1977), 594-606.
19. D. T. Lee and F. P. Preparata, Euclidean shortest paths in the presence of rectilinear barriers, Networks 14 (1984), 393-410.
20. K. Mehlhorn, "Sorting and Searching," Data Structures and Algorithms, Vol. 1, Springer-Verlag, Heidelberg, 1984.
21. J. O'Rourke, "Computational Geometry in C," Cambridge Univ. Press, Cambridge, 1994.
22. F. P. Preparata and M. I. Shamos, "Computational Geometry: An Introduction," Springer-Verlag, New York, 1985.
23. J. H. Reif and S. Sen, An efficient output-sensitive hidden-surface removal algorithm and its parallelization, in "Proceedings 4th Annual ACM Symposium Computer Geometry," pp. 193-200, 1988.
24. D. D. Sleator, R. E. Tarjan, and W. P. Thurston, Rotation distance, triangulations, and hyperbolic geometry, J. Amer. Math. Soc. 1 (1988), 647-682.
25. R. E. Tarjan, "Data Structures and Network Algorithms," CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, Society for Industrial Applied Mathematics, 1983.