Guarding art galleries: The extra cost for sculptures is linear

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

Volumn 5124 LNCS, Issue , 2008, Pages 41-52

  Addario Berry, Louigi ^a   Amini, Omid ^b   Sereni, Jean Sébastien ^c   Thomassé, Stéphan ^d  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c CHARLES UNIVERSITY   (Czech Republic)

^d LIRMM   (France)

Author keywords

Art gallery; Pseudo triangulation

Indexed keywords

BOOLEAN FUNCTIONS; GRAPH THEORY; MATHEMATICAL OPERATORS; TECHNICAL PRESENTATIONS; TOPOLOGY;

APPLICATIONS.; ART GALLERIES; ART GALLERY; ART GALLERY PROBLEMS; C CONVEXES; OPTIMAL VALUES; PSEUDO-TRIANGULATION; QUADRATIC BOUNDS;

TREES (MATHEMATICS);

EID: 54249155222     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69903-3_6     Document Type: Conference Paper

References (25)

1. Aloupis, G., Bose, P., Dujmovic, V., Gray, C., Langerman, S., Speckmann, B.: Guarding Fat Polygons and Triangulating Guarded Polygons, September (preprint, 2007)
2. Avis, D., Toussaint, G.T.: An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition 13(6), 395-398 (1981)
3. Chvatal, V.: A combinatorial theorem in plane geometry. J. Combin. Theory Ser. B 18, 39-41 (1975)
4. opt)-Approximation Algorithm for Art Gallery Problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 163-174. Springer, Heidelberg (2007)
5. Efrat, A., Guibas, L.J., Har-Peled, S., Lin, D.G., Mitchell, J.S.B., Murali, T.M.: Sweeping simple polygons with a chain of guards. In: Proc. 11th annual ACM-SIAM symposium on Discrete algorithms, pp. 927-936 (2000)
6. Edelsbrunner, H., O'Rourke, J., Welzl, E.: Stationing guards in rectilinear art galleries. Computer vision, graphics, and image processing 27(2), 167-176 (1984)
7. Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31(1), 79-113 (2001)
8. Fisk, S.: A short proof of Chvatals watchman theorem. J. Combin. Theory Ser. B 24(3), 374 (1978)
9. Fragoudakis, C., Markou, E., Zachos, S.: Maximizing the guarded boundary of an Art Gallery is APX-complete. Gomput. Geom. 38(3), 170-180 (2007)
10. Ghosh, S.: Approximation algorithms for art gallery problems. In: Proc. Canadian Inform. Process. Soc. Congress, pp. 429-434 (1987)
11. Honsberger, R.: Mathematical Gems 11. Dolciani Mathematical Expositions No. 2. Mathematical Association of America, Washington, pp. 104-110 (1976)
12. Kahn, J., Klawe, M., Kleitman, D.: Traditional Galleries Require Fewer Watchmen. SIAM J. Algebraic Discrete Methods 4, 194-206 (1983)
13. Kranakis, E., Pocchiola, M.: Camera placement in integer lattices. Discrete and Comput. Geom. 12(1), 91-104 (1994)
14. Laurentini, A.: Guarding the walls of an art gallery. The Visual Computer 15(6), 265-278 (1999)
15. Liaw, B.C., Huang, N.F., Lee, R.C.T.: The minimum cooperative guards problem on k-spiral polygons. In: Proc. of 5th Canadian Conference on Computational Geometry, pp. 97-101 (1993)
16. Lee, D., Lin, A.: Computational complexity of art gallery problems. IEEE Trans. Inform. Theory 32(2), 276-282 (1986)
17. Michael, T., Pinciu, V.: Art gallery theorems for guarded guards. Comput. Geom. 26(3), 247-258 (2003)
18. O'Rourke, J.: Art gallery theorems and algorithms. Oxford University Press, New York (1987)
19. Rote, G., Santos, F., Streinu, I.: Pseudo-triangulations: A survey, Arxiv preprint math/0612672vl (December 2006)
20. Sack, J.R.: An O(n log n) algorithm for decomposing simple rectilinear polygons into convex quadrilaterals. In: Proc. 20th Conference on Communications, Control, and Computing, pp. 64-74 (1982)
21. Shermer, T.C.: Recent results in art galleries [geometry]. Proc. IEEE 80(9), 1384-1399 (1992)
22. Speckmann, B., Tóth, CD.: Allocating Vertex p-Guards in Simple Polygons via, Pseudo-Triangulations. Discrete Comput. Geom. 33(2), 345-364 (2005)
23. Szabo, L.: Recent results on illumination problems. Bolyai Soc. Math. Stud. 6, 207-221 (1997)
24. Toth, L.F.: Illumination of convex discs. Acta Math. Hungar. 29(3-4), 355-360 (1977)
25. Urrutia, J.: Art gallery and illumination problems. Handbook of Computational Geometry, 973-1027 (2000)