Computing the visibility graph of points within a polygon

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 27-35

  Ben Moshe, Boaz ^a   Hall Holt, Olaf ^b   Katz, Matthew J ^a   Mitchell, Joseph S B ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Stony Brook University   (United States)

Author keywords

Fatness; Guarding; Illumination; Output sensitive algorithms; Polygons; Visibility graphs

Indexed keywords

ALGORITHMS; CAMERAS; COMPUTER SCIENCE; LIGHTING; PROBLEM SOLVING; SENSORS;

GUARDING; OUTPUT-SENSITIVE ALGORITHMS; POLYGONS; VISIBILITY GRAPHS;

COMPUTATIONAL GEOMETRY;

EID: 4544351903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997825     Document Type: Conference Paper

References (25)

1. P. K. Agarwal. Partitioning arrangements of lines: II. Applications. Discrete Comput. Geom., 5:533-573, 1990.
2. P. K. Agarwal. Range searching. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 31, pages 575-598. CRC Press LLC, Boca Raton, FL, 1997.
3. P. K. Agarwal, N. Alon, B. Aronov, and S. Suri. Can visibility graphs be represented compactly? Discrete Comput. Geom., 12:347-365, 1994.
4. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 1-56. American Mathematical Society, Providence, RI, 1999.
5. T. Asano, T. Asano, L. J. Guibas, J. Hershberger, and H. Imai. Visibility of disjoint polygons. Algorithmica, 1:49-63, 1986.
6. F. Aurenhammer and R. Klein. Voronoi diagrams. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 201-290. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
7. J. Basch, L. J. Guibas, and G. D. Ramkumar. Reporting red-blue intersections between two sets of connected line segments. In Proc. 4th Annu. European Sympos. Algorithms, volume 1136 of Lecture Notes Comput. Sci., pages 302-319. Springer-Verlag, 1996.
8. B. Ben-Moshe, M. J. Katz, J. S. B. Mitchell, and Y. Nir. Visibility preserving terrain simplification - An experimental study. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pages 303-311, 2002.
9. G. S. Brodal and R. Jacob. Dynamic planar convex hull. In Proc. 43rd IEEE Sympos. Foundations of Computer Science, pages 617-626, 2002.
10. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. Journal of the ACM, 48(1):1-12, 2001.
11. L. P. Chew and R. L. Drysdale, III. Voronoi diagrams based on convex distance functions In Proc. 1st Annu. ACM Sympos. Comput. Geom., pages 235-244, 1985.
12. F. Chin, J. Snoeyink, and C. A. Wang. Finding the medial axis of a simple polygon in linear time. Discrete Comput. Geom., 21(3):405-420, 1999.
13. S. K. Ghosh and D. M. Mount. An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput., 20:888-910, 1991.
14. L. J. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci., 39(2):126-152, Oct. 1989.
15. L. J. Guibas, J. E. Hershberger, J. S. B. Mitchell, and J. S. Snoeyink. Approximating polygons and subdivisions with minimum link paths. Internat. J. Comput. Geom. Appl., 3(4):383-415, Dec. 1993.
16. L. J. Guibas, M. H. Overmars, and M. Sharir. Intersecting line segments, ray shooting and other applications of geometric partitioning techniques. In Proc. 1st Scand. Workshop Algorithm Theory, volume 318 of Lecture. Notes Comput. Sci., pages 64-73, Springer-Verlag, 1988.
17. S. Har-Peled and M. Sharir. Online point location in planar arrangements and its applications. Discrete Comput. Geom., 26:19-40, 2001.
18. J. Hershberger. An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica, 4:141-155, 1989.
19. S. Kapoor, S. N. Maheshwari, and J. S. B. Mitchell. An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput. Geom., 18:377-383, 1997.
20. D. T. Lee. Proximity and reachability in the plane. Report R-831, Dept. Elect. Engrg., Univ. Illinois, Urbana, IL, 1978.
21. M. H. Overmars and E. Welzl. New methods for computing visibility graphs. In Proc. 4th Annu. ACM Sympos. Comput. Geom., pages 164-171, 1988.
22. M. Pocchiola and G. Vegter. Computing the visibility graph via pseudo-triangulations. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 248-257, 1995.
23. M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom., 16:419-453, Dec. 1996.
24. J. Urrutia. Art gallery and illumination problems. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 973-1027. North-Holland, 2000.
25. 2) time. Inform. Process. Lett., 20:167-171, 1985.