Visibility queries in simple polygons and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1533 LNCS, Issue , 1998, Pages 357-367

  Aronov, Boris ^a   Guibas, Leonidas J ^b   Teichmann, Marek ^c   Zhang, Li ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b Stanford University   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; TREES (MATHEMATICS);

CANONICAL DECOMPOSITION; KINETIC ALGORITHMS; OUTPUT-SENSITIVE ALGORITHM; POLYGONAL PATH; POLYLOGARITHMIC; SHORTEST PATH TREE; SPACE DATA STRUCTURES; WEAK VISIBILITY;

VISIBILITY;

EID: 84867469910     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_38     Document Type: Conference Paper

References (10)

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. 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.
5. L. J. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci., 39:126-152, 1989.
6. 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:209-233, 1987.
7. 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.
8. J. Hershberger and S. Suri. A pedestrian approach to ray shooting: Shoot a ray, take a walk. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 54-63, 1993.
9. M. H. Overmars. The Design of Dynamic Data Structures, volume 156 of Lecture Notes Comput. Sci. Springer-Verlag, Heidelberg, West Germany, 1983.
10. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29:669-679, 1986.