Visibility graphs of towers

Computational Geometry: Theory and Applications

Volumn 7, Issue 3, 1997, Pages 161-172

  Colley, Paul ^a   Lubiw, Anna ^b   Spinrad, Jeremy ^c  

^a QUEEN S UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040681731     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00033-X     Document Type: Article

References (21)

1. J. Abello, O. Egecioglu and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order I: from visibility graphs to maximal chains, Manuscript (1992).
2. J. Abello, O. Egecioglu and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order II: from maximal chains to polygons, Manuscript (1992).
3. A. Brandstädt, J. Spinrad and L. Stewart, Bipartite permutation graphs are bipartite tolerance graphs, Congressus Numerantium 58 (1987) 165-174.
4. S.H. Choi, S.Y. Shin and K.-Y. Chwa, Characterizing and recognizing the visibility graphs of a funnel-shaped polygon, 3rd Internat. Symp. Algorithms Comput. (ISAAC), Japan, 1992. Also, Technical Report CS-TR-92-71, Computer Science Department, Korea Advanced Institute of Science and Technology, Seoul, Republic of Korea, Submitted for publication.
5. S.H. Choi, S.Y. Shin and K.-Y. Chwa, Characterizing and recognizing the visibility graphs of a funnel-shaped polygon, 3rd Internat. Symp. Algorithms Comput. (ISAAC), Japan, 1992. Also, Technical Report CS-TR-92-71, Computer Science Department, Korea Advanced Institute of Science and Technology, Seoul, Republic of Korea, Submitted for publication.
6. P. Colley, Visibility graphs of uni-monotone polygons, M.Math. Thesis, Dept. of Computer Science, University of Waterloo, Waterloo, Canada, 1991.
7. P. Colley, Recognizing visibility graphs of unimonotone polygons, in: Proc. 4th Canad. Conf. Comput. Geom., St. John's, Newfoundland (1992) 29-34.
8. C. Coullard and A. Lubiw, Distance visibility graphs, Internat. J. Comput. Geom. Appl. 2 (1992) 349-362.
9. R. Courant and H. Robbins, What is Mathematics? An Elementary Approach to Ideas and Methods (Oxford University, London, 1951).
10. H. El-Gindy, Hierarchical decomposition of polygons with applications, Ph.D. Thesis, McGill University, Montreal, Canada, 1985.
11. H. Everett, Visibility graph recognition, Ph.D. Thesis, University of Toronto, Toronto, Canada, 1990.
12. H. Everett and D. Corneil, Recognizing visibility graphs of spiral polygons, J. Algorithms 11 (1990) 1-26.
13. H. Everett, A. Lubiw and J. O'Rourke, Recovery of convexity from external visibility graphs, Manuscript (1991).
14. S.K. Ghosh, On recognizing and characterizing visibility graphs of simple polygons, Lecture Notes in Computer Science 318 (Springer, Berlin, 1988) 96-104.
15. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
16. Lin and Skiena, Complexity aspects of visibility graphs, Manuscript (1992).
17. J. O'Rourke, Art Gallery Theorems and Algorithms (Oxford University Press, Oxford, 1987).
18. J. O'Rourke, Computational geometry column 18, SIGACT News 24 (1993) 20-25.
19. F.P. Preparata and M.I. Shamos, Computational Geometry: an Introduction (Springer, New York, 1985).
20. J. Spinrad, A. Brandstädt and L. Stewart, Bipartite permutation graphs, Discrete Appl. Math. 18 (1987) 279-292.
21. G. Steiner and L.K. Stewart, A linear time algorithm to find the jump number of two dimensional partial orders, Order 3 (1987) 359-367.