How to place efficiently guards and paintings in an art gallery

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

Volumn 3746 LNCS, Issue , 2005, Pages 145-154

  Fragoudakis, Christodoulos ^a   Markou, Euripides ^b   Zachos, Stathis ^a,c  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF ATHENS   (Greece)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ART GALLERY; CONSTANT RATIOS; POLYGON;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; DECORATION; POLYNOMIALS; PROBLEM SOLVING;

PAINTING;

EID: 33646509440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11573036_14     Document Type: Conference Paper

References (14)

1. Lee, D., Lin, A., Computational complexity of art gallery problems, IEEE Trans. Inform. Theory 32, 276-282, 1986.
2. O'Rourke, J., Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987.
3. Shmoys, D., Tardos, E., An approximation algorithm for the generalized assignment problem, Mathematical Programming A, 62:461-74, 1993.
4. Shermer, T., Recent results in Art Galleries, Proc. of the IEEE, 1992.
5. Urrutia, J., Art gallery and Illumination Problems, Handbook on Computational Geometry, 1998.
6. Eidenbenz, S., (In-)Approximability of Visibility Problems on Polygons and Terrains, PhD Thesis, ETH Zurich, 2000.
7. Eidenbenz, S., Inapproximability Results for Guarding Polygons without Holes, Lecture notes in Computer Science, Vol. 1533 (ISAAC'98), p. 427-436, 1998.
8. Ghosh, S., Approximation algorithms for Art Gallery Problems, Proc. of the Canadian Information Processing Society Congress, pp. 429-434, 1987.
9. Hochbaum, D., Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996.
10. Hochbaum, D., Approximating Covering and Packing Problems in: Approximation Algorithms for NP-Hard Problems (ed. Dorit Hochbaum), pp. 94-143, PWS Publishing Company, 1996.
11. Avis, D., Rappaport, D., Computing the largest empty convex subset of a set of points, Proc. 1st Ann. ACM Symposium Computational Geometry, pp. 161-167, 1985.
12. Dobkin, D., Edelsbrunner, H., Overmars, H., Searching for Empty Convex Polygons, Algorithmica 5, pp. 561-571, 1990.
13. Edelsbrunner, H., Guibas, L., Topologically sweeping an arrangement, J. Comput. System Sci. 38, pp. 165-194, 1989.
14. Chekuri, C., Khanna, S., A PTAS for the Multiple Knapsack problem, Proc. 11th ACM Symp on Discrete Algorithms, 213-222, 2000.