A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems

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

Volumn 4619 LNCS, Issue , 2007, Pages 163-174

  Deshpande, Ajay ^a   Kim, Taejung ^b   Demaine, Erik D ^a   Sarma, Sanjay E ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Dankook University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; POLYNOMIALS; PROBLEM SOLVING;

POINT GUARD PROBLEM; PSEUDOPOLYNOMIALS;

APPROXIMATION ALGORITHMS;

EID: 38149011528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_15     Document Type: Conference Paper

References (16)

1. Bose, P., Lubiw, A., Munro, J.I.: Efficient visibility queries in simple polygons. In: Proc. 4th Canad. Conf. Comput. Geom. pp. 23-28 (1992)
2. Guibas, L.J., Motwani, R., Raghavan, P.: The robot localization problem. SIAM J. Comput. 26(4), 1120-1138 (1997)
3. González-Banos, H., Latombe, J.: A randomized art-gallery algorithm for sensor placement. In: Proc. 17th Symp. Comput. Goem, pp. 232-240 (2001)
4. Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31, 79-113 (2001)
5. Ghosh, S.: Approximation algorithm for art gallery problems. In: Canad. Information Processing Soc. Congress (1987)
6. Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. In: Proc. 10th Symp. Comp. Geom. pp. 293-302 (1994)
7. Urrutia, J.: Art Gallery and Illumination Problems. In: Sack, J. R., Urrutia, J. (eds.) Handbook of Computational Geometry (2000)
8. O'Rourke, J.: Art Gallery Theorems and Algorithms (1987)
9. Shermer, T.: Recent results in art galleries. Proc. IEEE. 80, 1384-1399 (1992)
10. Chvátal, V.: A combinatorial theorem in plane geometry. J. Combinat. Theory B 18, 39-41 (1975)
11. Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Info. Theory. IT-32, 276-282 (1986)
12. Brodén, B., Hammar, M., Nilsson, B.J.: Guarding lines and 2-link polygons is APX-hard. In: Proc. 13th Canad. Conf. Comp. Geom. pp. 45-48 (2001)
13. Erickson, J.: Nice point sets can have nasty Delaunay triangulations. In: Proc. 17th Symp. Comp. Geom. pp. 96-105 (2001)
14. Erickson, J.: Dense point sets have sparse Delaunay triangulations: or "...but not too nasty". In: Proc. 13th Symp. Disc. Algo. pp. 125-134 (2002)
15. Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Info. Proc. Lett. 100(6), 238-245 (2006)
16. Valtr, P.: Guarding galleries where no point sees a small area. Israel J. Math. 104, 1-16 (1998)