Multiple point visibility and related problems

References

• Honsberger , R. 1976 . “ Mathematical Assoc. of America ” . In Mathematical Geoms II
   Google Scholar
• Guibas , L. , Hershberger , J. , Leven , D. , Sharir , M. and Tarjan , R.E. 1987 . Linear time algorithms for visibility and shortest path problems inside simple polygons . Algorithmica , 2 : 209 – 233 .
   Google Scholar
• Lee , D. T. 1983 . Visibility of a simple polygon . Computer Vision, Graphics, and Image Processing , 22 : 207 – 221 .
   Google Scholar
• Preparata , F. P. and Shamos , M. I. 1985 . Computational geometry , New York : Springer-Verlag .
   Google Scholar
• Avis , D. and Toussaint , G. T. 1981 . An optimal algorithm for determining the visibility polygon from an edge . IEEE Trans. Comput. , C-30 : 910 – 914 .
   Web of Science ®Google Scholar
• Ghosh , S. K. 1991 . Computing the visibility polygon from a convex set and related problems . Journal of Algorithms , 12 : 75 – 95 .
   Google Scholar
• Lee , D. T. and Lin , K. 1986 . Computational complexity of art gallery problems . IEEE Trans. on Information Theory , IT-32 ( No. 2 ) : 276 – 282 .
   Web of Science ®Google Scholar
• Chvátal , V. 1975 . A combinatorial theorem in plane geometry . Journal of Combinatorial Theory , 18 : 39 – 41 . Ser. B
   Google Scholar
• Fisk , S. 1978 . A short proof of Chvátal's watchman theorem . Journal of Combinatorial Theory , 24 : 374 – 374 . Ser. B
   Google Scholar
• Avis , D. and Toussaint , G. T. 1981 . An efficient algorithm for decomposing a polygon into star-shaped polygons . Pattern Recognition , 13 : 395 – 398 .
   Web of Science ®Google Scholar
• T. Lee , D. and Preparata , F. P. 1979 . An optimal algorithm for finding the kernel of a polygon . Journal of the Association for Computing Machinery , 26 ( No. 3 ) : 415 – 421 .
   Web of Science ®Google Scholar
• Nishizeki , T. and Chiba , N. 1988 . Planar graphs: theory and algorithms , Amsterdam : North-Holland . North-Holland Mathematics Studies 140
   Google Scholar