Visibility queries and maintenance in simple polygons

Discrete and Computational Geometry

Volumn 27, Issue 4, 2002, Pages 461-483

  Aronov, B ^a   Guibas, L J ^b   Teichmann, M ^c   Zhang, L ^b,d  

^a POLYTECHNIC UNIVERSITY   (United States)

^b Stanford University   (United States)

^c INSTITUTE FOR RESEARCH IN IMMUNOLOGY AND CANCER   (Canada)

^d HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035999223     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0089-9     Document Type: Article

References (17)

1. J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Sympos, Discrete Algorithms, pages 747-756, 1997.
2. P. Bose, A. Lubiw, and J. I. Munro. Efficient visibility queries in simple polygons. In Proc. 4th Canad. Conf. Comput. Geom., pages 23-28, 1992.
3. B. Chazelle. A theorem on polygon cutting with applications. In Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci., pages 339-349, 1982.
4. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9(2): 145-158, 1993.
5. B. Chazelle and L. J. Guibas. Visibility and intersection problems in plane geometry. In Proc. 1st Annu. ACM Sympos. Comput. Geom., pages 135-146, 1985.
6. 6. D. Z. Chen and O. Daescu. Maintaining visibility of a polygon with a moving point of view. In Proc. 8th Canad. Conf. Comput. Geom., pages 240-245, 1996.
7. H. ElGindy and D. Avis. A linear algorithm for computing the visibility polygon from a point. J. Algorithms, 2:186-197, 1981.
8. S. K. Ghosh and D. M. Mount. An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput., 20:888-910, 1991.
9. L. J. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. J. Comput. System Sci., 39:126-152, 1989.
10. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear-time algorithms for visibility and shortest path prolems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
11. L. J. Guibas, R. Motwani, and P. Raghavan. The robot localization problem in two dimensions. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 259-268, 1992.
12. J. Hershberger and S. Suri. A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms, 18:403-431, 1995.
13. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12:28-35, 1983.
14. J. Matoušek. Construction of ε-nets. Discrete Comput. Geom., 5:427-448, 1990.
15. 15. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. System. Sci., 23:166-204, 1981.
16. N. Samak and R. E. Tarjan. Planar point location using persistent search trees. Comm. ACM, 29:669-679, 1986.
17. G. Vegter. The visibility diagram: a data structure for visibility problems and motion planning. In Proc. 2nd Scand. Workshop Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 97-110. Springer-Verlag, Berlin, 1990.