Approximate guarding of monotone and rectilinear polygons

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1362-1373

  Nilsson, Bengt J ^a  

^a MALMÖ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; NUMBER THEORY;

APPROXIMATION ALGORITHMS; POLYGONS; VERTICES;

APPROXIMATION THEORY;

EID: 26444497927     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_110     Document Type: Conference Paper

References (22)

1. A. AGGARWAL. The Art Gallery Theorem: Its Variations, Applications and Algorithmic Aspects. PhD thesis, Johns Hopkins University, 1984.
2. B. BEN-MOSHE, M.J. KATZ, J.S.B. MITCHELL. A Constant-Factor Approximation Algorithm for Optimal Terrain Guarding. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, SODA '05, 2005.
3. B. BRODÉN, M. HAMMAR, B.J. NILSSON. Guarding Lines and 2-Link Polygons is APX-hard. In Proc. 13th Canadian Conference on Computational Geometry, CCCG'01, pages 45-48, 2001.
4. B. CHAZELLE. Triangulating a Simple Polygon in Linear Time. In Proc. 31st Symposium on Foundations of Computer Science, pages 220-230, 1990.
5. D.Z. CHEN, V. ESTIVILL-CASTRO, J. URRUTIA. Optimal Guarding of Polygons and Monotone Chains. In Proc. 7th Canadian Conference on Computational Geometry, CCCG'95, pages 133-138, 1995.
6. W. CHIN, S. NTAFOS. Optimum Watchman Routes. Information Processing Letters, 28:39-44, 1988.
7. V. CHVÁTAL. A Combinatorial Theorem in Plane Geometry. Journal of Combinatorial Theory B, 13(6):395-398, 1975.
8. K.L. CLARKSON, K. VARADARAJAN. Improved Approximation Algorithms for Geometric Set Cover. In Proc. 21st ACM Symposium on Computational Geometry, 2005.
9. J.C. CULBERSON, R.A. RECKHOW. Covering Polygons is Hard. In Proc. 29th Symposium on Foundations of Computer Science, pages 601-611, 1988.
10. M. DE BERG. On Rectilinear Link Distance. Computational Geometry: Theory and Applications, 1(1):13-34, 1991.
11. A. EFRAT, S. HAR-PELED. Locating Guards in Art Galleries. In Proc. 2nd IFIP International Conference on Theoretical Computer Science, 2002.
12. S. EIDENBENZ. Inapproximability Results for Guarding Polygons without Holes. In Proc. 9th Annual International Symposium on Algorithms and Computation, pages 427-436, 1998.
13. S. EIDENBENZ. Inapproximability of Visibility Problems on Polygons and Terrains. PhD thesis, ETH, Zurich, 2000.
14. S. FISK. A Short Proof of Chvátal's Watchman Theorem. Journal of Combinatorial Theory B, 24:374, 1978.
15. S.K. GHOSH. Approximation Algorithms for Art Gallery Problems. In Proceedings of the Canadian Information Processing Society Congress, 1987.
16. F. HOFFMANN, M. KAUFMANN, K. KRIEGEL. The Art Gallery Theorem for Polygons with Holes. In Proc. 32nd IEEE Symposium on the Foundations of Computer Science, pages 39-48, 1991.
17. B. JOE, R.B. SIMPSON. Correction to Lee's Visibility Polygon Algorithm. BIT, 27:458-473, 1987.
18. D.T. LEE. Visibility of a Simple Polygon. Computer Vision, Graphics, and Image Processing, 22:207-221, 1983.
19. D.T. LEE, A.K. LIN. Computational Complexity of Art Gallery Problems. IEEE Transactions on Information Theory, IT-32:276-282, 1986.
20. C. LEVCOPOULOS. Heuristics for Minimum Decompositions of Polygons. PhD thesis, University of Linköping, Linköping, Sweden, 1987.
21. B.J. NILSSON. Guarding Art Galleries - Methods for Mobile Guards. PhD thesis, Lund University, 1995.
22. J. O'ROURKE. Art Gallery Theorems and Algorithms. Oxford University Press, 1987.