A constant-factor approximation algorithm for optimal 1.5D terrain guarding

SIAM Journal on Computing

Volumn 36, Issue 6, 2007, Pages 1631-1647

  Ben Moshe, Boaz ^a   Katz, Matthew J ^b   Mitchell, Joseph S B ^c  

^a ARIEL UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c Stony Brook University   (United States)

Author keywords

Approximation algorithms; Geometric optimization; Guarding

Indexed keywords

GEOMETRIC OPTIMIZATION; TERRAIN GUARDING;

COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS;

APPROXIMATION ALGORITHMS;

EID: 37849011990     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704446384     Document Type: Article

References (17)

1. B. BEN-MOSHE, M. J. KATZ, AND J. S. B. MITCHELL, A constant-factor approximation algorithm for optimal terrain guarding, in Proceedings of the 16th Annual ACM-SIAM Symposium Discrete Algorithms, Vancouver, BC, 2005, SIAM, Philadelphia, 2005, pp. 515-524.
2. P. BOSE, T. SHERMER, G. TOUSSAINT, AND B. ZHU, Guarding polyhedral terrains, Comput. Geom. Theory Appl., 7 (1997), pp. 173-185.
3. H. BRÖNNIMANN AND M. T. GOODRICH, Almost optimal set covers in finite VC-dimension, Discrete Comput. Geom., 14 (1995), pp. 263-279.
4. D. Z. CHEN, V. ESTIVILL-CASTRO, AND J. URRUTIA, Optimal guarding of polygons and monotone chains, in Proceedings of the 7th Annual Canadian Conference on Computational Geometry, Quebec City, QB, 1995, pp. 133-138.
5. O. CHEONG, A. EFRAT, AND S. HAR-PELED, On finding a guard that sees most and a shop that sells most, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 2004, SIAM, Philadelphia, 2004, pp. 1091-1100.
6. A. EFRAT AND S. HAR-PELED, Locating guards in art galleries, in Proceedings of the 2nd Annual IFIP International Conference on Theoretical Computer Science, Montréal, QB, 2002, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002, pp. 181-192.
7. S. J. EIDENBENZ, (In-)Approximability of Visibility Problems on Polygons and Terrains, Ph.D. thesis, Department of Computer Science, ETH Zürich, Switzerland, 2000.
8. S. J. EIDENBENZ, Approximation algorithms for terrain guarding, Inform. Process. Lett., 82 (2002), pp. 99-105.
9. S. J. EIDENBENZ, C. STAMM, AND P. WIDMAYER, Inapproximability results for guarding polygons and terrains, Algorithmica, 31 (2001), pp. 79-113.
10. S. K. GHOSH, Approximation algorithms for art gallery problems, in Proceedings of the Canadian Information Processing Society Congress, 1987, pp. 429-434.
11. H. GONZÁLEZ-BANOS AND J.-C. LATOMBE, A randomized art-gallery algorithm for sensor placement, in Proceedings of the 17th Annual ACM Symposium on Computational Geometry, Medford, MA, 2001, pp. 232-240.
12. J. M. KEIL, Polygon decomposition, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier Science, North-Holland, Amsterdam, 2000, pp. 491-518.
13. B. J. NILSSON, Guarding Art Galleries-Methods for Mobile Guards, Ph.D. thesis, Department of Computer Science, Lund University, Lund, Sweden, 1995.
14. J. O'ROURKE, Art Gallery Theorems and Algorithms, Internat. Ser. Monogr. Comput. Sci., Oxford University Press, New York, 1987.
15. J. O'ROURKE AND K.J. SUPOWIT, Some NP-hard polygon decomposition problems, IEEE Trans. Inform. Theory, 30 (1983), pp. 181-190.
16. T. C. SHERMER, Recent results in art galleries, Proc. IEEE, 80 (1992), pp. 1384-1399.
17. J. URRUTIA, Art gallery and illumination problems, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., North-Holland, Amsterdam, 2000, pp. 973-1027.