Positioning guards at fixed height above a terrain - An optimum inapproximability result

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

Volumn 1461 LNCS, Issue , 1998, Pages 187-198

  Eidenbenz, Stephan ^a   Stamm, Christoph ^a   Widmayer, Peter ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LANDFORMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; HARDNESS RESULT; INAPPROXIMABILITY; MINIMIZING THE NUMBER OF; NP-HARD; NUMBER OF TRIANGLES; POLYNOMIAL-TIME ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84896748803     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_16     Document Type: Conference Paper

References (10)

1. P. Bose, T. Shermer, G. Toussaint and B. Zhu; Guarding Polyhedral Terrains; Computational Geometry 7, pp. 173-185, Elsevier Science B. V., 1997.
2. D. Z. Chen, V. Estivill-Castro, J. Urrutia; Optimal Guarding of Polygons and Monotone Chains (Extended Abstract); Proc. Seventh Canadian Conference on Computational Geometry, August 1995, 133-138.
3. St. Eidenbenz, Ch. Stamm, P. Widmayer; Inapproximability of Some Art Gallery Problems; manuscript, 1998.
4. Uriel Feige; A Threshold of ln n for Approximating Set Cover; STOC'96, pp. 314-318,1996.
5. M. van Kreveld; Digital Elevation Models and TIN Algorithms; in Algorithmic Foundations of Geographic Information Systems (ed. van Kreveld et al.), LNCS tutorial Vol. 1340, pp. 37-78, Springer (1997).
6. B. Nilsson; Guarding Art Galleries - Methods for Mobile Guards; doctoral thesis, Department of Computer Science, Lund University, 1994.
7. J. O'Rourke; Art Gallery Theorems and Algorithms; Oxford University Press, New York (1987).
8. T. Shermer; Recent Results in Art Galleries; Proc. of the IEEE, 1992.
9. J. Urrutia; Art Gallery and Illumination Problems; to appear in Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia, 1998.
10. B. Zhu; Computing the Shortest Watchtower of a Polyhedral Terrain in O(n log n) Time; in Computational Geometry 8 (1997), pp. 181-193, Elsevier Science B.V.