Computing the maximum clique in the visibility graph of a simple polygon

Journal of Discrete Algorithms

Volumn 5, Issue 3, 2007, Pages 524-532

  Ghosh, Subir Kumar ^a   Shermer, Thomas Caton ^b   Bhattacharya, Binay Kumar ^b   Goswami, Partha Pratim ^c  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF KALYANI   (India)

Author keywords

Algorithm; Convex fan; Convexity; Dynamic programming; Hamiltonian cycle; Hidden vertex set; Maximum clique; Simple polygon; Visibility graph

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; HAMILTONIANS;

CONVEX FAN; HAMILTONIAN CYCLE; HIDDEN VERTEX SET; MAXIMUM CLIQUE; SIMPLE POLYGON; VISIBILITY GRAPH;

ALGORITHMS;

EID: 34248631114     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.09.004     Document Type: Article

References (21)

1. Abello J., and Kumar K. Visibility graphs and oriented matroids. Discrete and Computational Geometry 28 (2002) 449-465
2. Asano T., Ghosh S.K., and Shermer T. Visibility in the plane. In: Sack J.-R., and Urrutia J. (Eds). Handbook of Computational Geometry (2000), North-Holland 829-876
3. D. Avis, D. Rappaport, Computing the largest empty convex subset of a set of points, in: Proceedings of the 1st ACM Symposium on Computational Geometry, 1985, pp. 161-167
4. Choi S.-H., Shin S.Y., and Chwa K.-Y. Characterizing and recognizing the visibility graph of a funnel-shaped polygon. Algorithmica 14 (1995) 27-51
5. Colley P., Lubiw A., and Spinrad J. Visibility graphs of towers. Computational Geometry: Theory and Applications 7 (1997) 161-172
6. S. Eidenbenz, In-approximability of visibility problems on polygons and terrains, Ph.D. Thesis, Institute for Theoretical Computer Science, ETH, Zurich, 2000
7. Eidenbenz S. In-approximability of finding maximum hidden sets on polygons and terrains. Computational Geometry: Theory and Applications 21 (2002) 139-153
8. Eidenbenz S., and Stamm C. Maximum clique and minimum clique partition in visibility graphs. Proceeding of IFIP TCS. Lecture Notes in Computer Science vol. 1872 (2000), Springer-Verlag 200-212
9. H. Everett, Visibility graph recognition, Ph.D. Thesis, University of Toronto, Toronto, 1990
10. Everett H., and Corneil D.G. Recognizing visibility graphs of spiral polygons. Journal of Algorithms 11 (1990) 1-26
11. Ghosh S.K. On recognizing and characterizing visibility graphs of simple polygons. Discrete and Computational Geometry 17 (1997) 143-162
12. Ghosh S.K., Maheshwari A., Pal S.P., Saluja S., and Veni Madhavan C.E. Characterizing and recognizing weak visibility polygons. Computational Geometry: Theory and Applications 3 (1993) 213-233
13. Ghosh S.K., and Mount D.M. An output-sensitive algorithm for computing visibility graphs. SIAM Journal on Computing 20 (1991) 888-910
14. Hershberger J. Finding the visibility graph of a polygon in time proportional to its size. Algorithmica 4 (1989) 141-155
15. Lee D.T., and Lin A.K. Computational complexity of art gallery problems. IEEE Transactions on Information Theory IT-32 (1986) 276-282
16. Lin S.Y., and Skiena S. Complexity aspects of visibility graphs. International Journal of Computational Geometry and Applications 5 (1995) 289-312
17. Lozano-Perez T., and Wesley M.A. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of ACM 22 (1979) 560-570
18. O'Rourke J. Art Gallery Theorems and Algorithms (1987), Oxford University Press, New York
19. Shapiro L.G., and Haralick R.M. Decomposition of two-dimensional shape by graph-theoretic clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-1 (1979) 10-19
20. Shermer T. Hiding people in polygons. Computing 42 (1989) 109-131
21. Streinu I. Non-stretchable pseudo-visibility graphs. Computational Geometry: Theory and Applications 31 (2005) 195-206