Characterizing and recognizing visibility graphs of funnel-shaped polygons

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

Volumn 650 LNCS, Issue , 1992, Pages 119-228

  Choi, Senng Hak ^a   Shin, Sung Yong ^a   Chwa, Kyung Yong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

HAMILTONIANS; VISIBILITY;

BOUNDARY EDGES; FUNNEL-SHAPED; GEOMETRIC STRUCTURE; HAMILTONIAN CYCLE; INPUT GRAPHS; PERFECT GRAPH; TIME ALGORITHMS; VISIBILITY GRAPHS;

GRAPH THEORY;

EID: 0039413233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56279-6_75     Document Type: Conference Paper

References (18)

1. Abello, J., O. Egecioglu, and K. Kumar, “Characterizing visibility graphs of staircase polygons,” manuscript (extended abstract), 1991.
2. Asano, T., T. Asano, L. Guibas, J. Hershberger, and H. Imai, “Visibility of disjoint polygons,” Algorithmica, vol. 1, pp. 49-63, 1986.
3. Avis, D. and G. T. Toussaint, “An optimal algorithm for determining the visibility of a polygon from an edge,” IEEE Trans. Computers, vol. 30, no. 12, pp. 910-914, 1981.
4. Chazelle, B. and L. Guibas, “Visibility and intersection problems in plane geometry,” Discrete and Computational Geometry, vol. 4, pp. 551-581, 1989.
5. Choi, S.-H., S. Y. Shin, and K.-Y. Chwa, “Characterizing and recognizing the visibility graph of a funnel-shaped polygon,” Tech. Report CS-TR-92-71, Dept. Comp. Sei., KAIST, Korea, 1992.
6. Coullard, C. and A. Lubiw, “Distance visibility graphs,” Proc. 7th ACM Symp. Computational Geometry, pp. 289-296, 1991.
7. EiGindy, H. A., “Hierarchical decomposition of polygons with applications,” Ph.D. dissertation, School of Comp. Sei., McGill Univ., Montreal, 1985.
8. Everett, H. and D. G. Corneil, “Recognizing visibility graphs of spiral polygons,” J. Algorithms, vol. 11, pp. 1-26, 1990.
9. Ghosh, S. K., “On recognizing and characterizing visibility graph of simple polygons,” Tech. Report JHU/EECS-86/14, Dept. EECS, The Johns Hopkins Univ., Baltimore, 1986. Also in Lecture Notes in Computer Science 318, R. Karlsson and A. Lingas Eds., Springer-Verlag, New York, 1988
10. Ghosh, S. K. and D. M. Mount, “An output-sensitive algorithm for computing visibility graphs,” SIAM J. Compui., vol. 20, no. 5, pp. 888-910, 1991.
11. Golumbic, M. C., Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
12. Guibas, L., J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, “Lineartime algorithms for visibility and shortest path problems inside triangulated simple polygons,” Algorithmica, vol. 2, pp. 209-233, 1987.
13. Hayward, R. B., “Weakly triangulated graphs,” J. Combinatorial Theory, B, vol. 39, pp. 200-209, 1985.
14. Hershberger, J., “An optimal visibility graph algorithm for triangulated simple polygons,” Algorithmica, vol. 4, pp. 141-155, 1989.
15. Johnson, D. S., “The NP-completeness column: an ongoing guide,” J. Algorithms, vol. 6, pp. 434-451, 1985.
16. Lee, D. T. and F. P. Preparata, “Euclidean shortest paths in the presence of rectilinear barriers,” Networks, vol. 14, no. 3, pp. 393-410, 1984.
17. O’Rourke, J., Art gallery theorems and algorithms, Oxford Univ. Press, New York, 1987.
18. Toussaint, G. T., “A linear-time algorithm for solving the strong hidden-line problem in a simple polygon,” Pattern Recognition Letters, vol. 4, pp. 449-451, 1986.