Inapproximability of finding maximum hidden sets on polygons and terrains

Computational Geometry: Theory and Applications

Volumn 21, Issue 3, 2002, Pages 139-153

  Eidenbenz, Stephan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Hiding; Inapproximability; Polygons; Terrains; Visibility

Indexed keywords

EID: 33750694333     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00029-3     Document Type: Article

References (17)

1. S. Arora, C. Lund, Hardness of approximations, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996, pp. 399-446.
2. P. Bose, T. Shermer, G. Toussaint, B. Zhu, Guarding polyhedral terrains, Computational Geometry 7 (1997) 173-185.
3. P. Crescenzi, V. Kann, A compendium of NP optimization problems, in: G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi (Eds.), Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties, Springer, Berlin, 1999. Also available at: http://www.nada.kth.se/theory/compendium/compendium.html.
4. S. Eidenbenz, Inapproximability results for guarding polygons without holes, in: Proc. of ISAAC '98, Lecture Notes in Computer Science, Vol. 1533,1998, pp. 427-436.
5. S. Eidenbenz, How many people can hide in a terrain?, in: Proc. of ISAAC '99, Lecture Notes in Computer Science, Vol. 1741, 1999, pp. 184-194.
6. S. Eidenbenz, C. Stamm, P. Widmayer, Inapproximability of some Art Gallery problems, in: Proc. of 10th Canadian Conf. Computational Geometry, 1998, pp. 64-65.
7. S. Eidenbenz, C. Stamm, P. Widmayer, Positioning guards at fixed height above a terrain - an optimum inapproximability result, in: Proc. of ESA '98, Lecture Notes in Computer Science, Vol. 1461,1998, pp. 187-198.
8. J.E. Goodman, J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL, 1997.
9. J. Hastad, Clique is hard to approximate within n '~£, in: Proc. of the Symposium on Foundations of Computer Science, 1996.
10. S. Kapoor, Efficient computation of geodesic shortest paths, in: Proc. of the Symposium on Theory of Computing, 1999, pp. 770-779.
11. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987.
12. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
13. T. Shermer, Hiding people in polygons, Computing 42 (1989) 109-131.
14. T. Shermer, Recent results in Art Galleries, Proc. of the IEEE (1992).
15. J. Urrutia, Art Gallery and illumination problems, in: J.-R. Sack, J. Urrutia (Eds.), Handbook onComputational Geometry, 1998.
16. M. van Kreveld, Digital elevation models and TIN algorithms, in: M. van Kreveld et al. (Eds.), Algorithmic Foundations of Geographic Information Systems, Lecture Notes in Computer Science, Vol. 1340, Springer, New York, 1997, pp. 37-78.
17. B. Zhu, Computing the shortest watchtower of a polyhedral terrain in O(;zlog/i) time, Computational Geometry 8 (1997) 181-193.