How many people can hide in a terrain?

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

Volumn 1741, Issue , 1999, Pages 184-194

  Eidenbenz, Stephan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; LANDFORMS;

APPROXIMATION RATIOS; MAXIMUM CLIQUE PROBLEMS; OPTIMAL PLACEMENTS; POLYNOMIAL-TIME ALGORITHMS; SIMPLE POLYGON;

POLYNOMIAL APPROXIMATION;

EID: 33750738772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_20     Document Type: Conference Paper

References (15)

1. S. Arora and C. Lund; Hardness of Approximations; in: Approximation Algorithms for NP-Hard Problems (ed. Dorit Hochbaum), PWS Publishing Company, pp. 399-446, 1996.
2. P. Bose, T. Shermer, G. Toussaint, and B. Zhu; Guarding Polyhedral Terrains; Computational Geometry 7, pp. 173-185, Elsevier Science B. V., 1997.
3. P. Crescenzi, V. Kann; A Compendium of NP Optimization Problems; in the book by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag, Berlin, 1999; also available in an online-version at: http://www.nada.kth.se/theory/compendium/compendium.html.
4. S. Eidenbenz, C. Stamm, and P. Widmayer; Inapproximability of some Art Gallery Problems; Proc. 10th Canadian Conf. Computational Geometry, pp. 64-65, 1998.
5. S. Eidenbenz, C. Stamm, and P. Widmayer; Positioning Guards at Fixed Height above a Terrain - An Optimum Inapproximability Result; Lecture Notes in Computer Science, Vol. 1461 (ESA’98), p. 187-198, 1998.
6. S. Eidenbenz; Inapproximability Results for Guarding Polygons without Holes; Lecture Notes in Computer Science, Vol. 1533 (ISAAC’98), p. 427-436, 1998.
7. ∈; Proc. of the Symposium on Foundations of Computer Science, 1996.
8. 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.
9. D. T. Lee and A. K. Lin; Computational Complexity of Art Gallery Problems; IEEE Trans. Info. Th, pp. 276-282, IT-32, 1986.
10. J. O’Rourke; Art Gallery Theorems and Algorithms; Oxford University Press, New York, 1987.
11. C.H. Papadimitriou; Computational Complexity; Addison-Wesley Publishing Company, 1994.
12. T. Shermer; Hiding People in Polygons; Computing 42, pp. 109-131, 1989.
13. T. Shermer; Recent results in Art Galleries; Proc. Of the IEEE, 1992;
14. J. Urrutia; Art Gallery and Illumination Problems; in Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia, 1998.
15. B. Zhu; Computing the Shortest Watchtower of a Polyhedral Terrain in O(n log n) Time; in Computational Geometry 8, pp. 181-193, Elsevier Science B.V., 1997.