Efficiently constructing the visibility graph of a simple polygon with obstacles

SIAM Journal on Computing

Volumn 30, Issue 3, 2000, Pages 847-871

  Kapoor, Sanjiv ^a   Maheshwari, S N ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Linked lists; Obstacles; Output sensitive; Simple polygon; Triangulation; Visibility graph

Indexed keywords

ALGORITHMS; GRAPH THEORY; SET THEORY; SORTING;

LINKED LISTS; VISIBILITY GRAPHS;

COMPUTATIONAL GEOMETRY;

EID: 0034945170     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795253591     Document Type: Article

References (9)

1. T. ASANO, T ASANO, L. GUIBAS, J. HERSUBERGER, AND H. IMAI, Visibility of disjoint polygons, Algorithmica, 1 (1986), pp. 49-63.
2. R. BAR-YEHUDA AND B. CHAZELLE, Triangulating disjoint Jordan chains, Internat. J. Comput. Geom. Appl., 4 (1994), pp. 475-481.
3. S.K. GHOSH AND D.M. MOUNT, An output-sensitive algorithm for computing visibility graphs, SIAM J. Comput., 20 (1991), pp. 888-910.
4. J. HERSHBERGER, Finding the visibility graph algorithm of a simple polygon in time proportional to its size, Algorithmica, 4 (1989), pp. 141-155.
5. S. KAPOOR AND S.N. MAHESHWARI, Efficient algorithms for Euclidean shortest paths and visibility graphs amongst polygonal obstacles, in proceedings of the Fourth ACM Symposium on Computational Geometry, Urbana-Champaign, IL, 1988, pp. 172-182.
6. S. KAPOOR, S.N. MAHESHWARI, AND J.S.B. MITCHELL, Efficient algorithms for Euclidean shortest paths amongst polygonal obstacles, Discrete Comput. Geom., 18 (1997), pp. 377-383.
7. M.H. OVERMARS AND E. WELZL, New methods for computing visibility graphs, in Proceedings of the Fourth ACM Symposium on Computational Geometry, Urbana-Champaign, IL, 1988, pp. 164-171.
8. F.P. PREPARATA AND M.I. SHAMOS, Computational Geometry - An Introduction, Springer-Verlag, Berlin, New York, Heidelberg, 1985.
9. 2) time, Inform. Process. Lett., 20 (1985), pp. 167-171.