论文信息 - On Recognizing and Characterizing Visibility Graphs of Simple Polygons

On Recognizing and Characterizing Visibility Graphs of Simple Polygons

In this paper, we establish three necessary conditions for recognizing visibility graphs of simple polygons and conjecture that these conditions are sufficient. We also show that visibility graphs of simple polygons do not posses the characteristics of several special classes of graphs.

Subir Kumar Ghosh

[1] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[2] Hossam Ahmed Elgindy,et al. Hierarchical decomposition of polygons with applications , 1985 .

[3] M. Golumbic. CHAPTER 3 – Perfect Graphs , 1980 .

[4] Robert M. Haralick,et al. Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[6] Wen-Lian Hsu,et al. Recognizing circle graphs in polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[8] J. O'Rourke. Art gallery theorems and algorithms , 1987 .

[9] David Avis,et al. Computing the largest empty convex subset of a set of points , 1985, SCG '85.

[10] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.