Guarding galleries and terrains

Information Processing Letters

Volumn 100, Issue 6, 2006, Pages 238-245

  Efrat, Alon ^a   Har Peled, Sariel ^b  

^a University of Arizona   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINE SEGMENTS; POLYGONS; TERRAINS;

ALGORITHMS; CONSTRAINT THEORY; DATA PROCESSING; NUMERICAL METHODS;

COMPUTATIONAL GEOMETRY;

EID: 33749991397     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.05.014     Document Type: Article

References (26)

1. A. Aggarwal, The art gallery problem: Its variations, applications, and algorithmic aspects, PhD thesis, Dept. of Comput. Sci., Johns Hopkins University, 1984
2. Bronnimann H., and Goodrich M.T. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14 (1995) 263-279
3. Basu S., Pollack R., and Roy M.-F. On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43 (1996) 1002-1045
4. I. Bjorling-Sachs, Variations on the Art Gallery Theorem, PhD thesis, Rutgers University, 1993
5. Clarkson K.L. Algorithms for polytope covering and approximation. Proc. 3rd Workshop Algorithms Data Struct. Lecture Notes in Comput. Sci. vol. 709 (1993) 246-252
6. M. de Berg, Generalized hidden surface removal, in: Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 1-10
7. de Berg M., van Kreveld M., Overmars M.H., and Schwarzkopf O. Computational Geometry: Algorithms and Applications. second ed. (2000), Springer-Verlag
8. A. Efrat, S. Har-Peled, Locating guards in art galleries, in: 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 181-192
9. A. Efrat, F. Hoffmann, K. Kriegel, C. Knauer, G. Rote, C. Wenk, Covering shapes by ellipses, in: ACM-SIAM Sympos. on Discrete Algorithms, 2002, pp. 453-454
10. ElGindy H., and Avis D. A linear algorithm for computing the visibility polygon from a point. J. Algorithms 2 (1981) 186-197
11. S. Eidenbenz, (In-)approximability of visibility problems on polygons and terrains, PhD thesis, diss. ETH no. 13683, 2000
12. Eidenbenz S. Approximation algorithms for terrain guarding. Inform. Process. Lett. 82 (2002) 99-105
13. H. Gonzalez-Banos, J.C. Latombe, A randomized art-gallery algorithm for sensor placement, in: Proc. 17th Annu. ACM Sympos. Comput. Geom., 2001, pp. 232-240
14. S.K. Ghosh, Approximation algorithms for art gallery problems, in: Proc. Canadian Inform. Process. Soc. Congress, 1987
15. Gewali L., Meng A., Mitchell J.S.B., and Ntafos S. Path planning in 0 / 1 / ∞ weighted regions with applications. ORSA J. Comput. 2 (1990) 253-272
16. F. Hoffmann, M. Kaufmann, K. Kriegel, The art gallery theorem for polygons with holes, in: Proc. 32nd Annu. IEEE Sympos. Found. Comput. Set., 1991, pp. 39-48
17. Hoffmann F. On the rectilinear art gallery problem. Proc. 17th Internat. Colloq. Automata Lang. Program. LBNCS vol. 443 (1990) 717-728
18. Har-Peled S. An output sensitive algorithm for discrete convex hulls. Comput. Geom. Theory Appl. 10 (1998) 125-138
19. G.F. Jennings, W.J. Lenhart, An art gallery theorem for line segments in the plane, in: G.T. Toussaint (Ed.), Pattern Recognition Letters Special Issue on Computational Geometry, 1993
20. S. Kahan, J. Snoeyink, On the bit complexity of minimum link paths: Superquadratic algorithms for problems solvable in linear time, in: Proc. 12th Annu. ACM Sympos. Comput. Geom., 1996, pp. 151-158
21. O'Rourke J. An alternative proof of the rectilinear art gallery theorem. J. Geom. 21 (1983) 118-130
22. O'Rourke J. Art Gallery Theorems and Algorithms. The International Series of Monographs on Computer Science (1987), Oxford Univ. Press, New York
23. O'Rourke J., and Supowit K.J. Some NP-hard polygon decomposition problems. IEEE Trans. Inform. Theory IT-30 (1983) 181-190
24. J. Urrutia, Art gallery and illumination problems, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, 2000, pp. 973-1027
25. Valtr P. Guarding galleries where no point sees a small area. Israel J. Math. 104 (1998) 1-16
26. Varberg D.E. Pick's theorem revisited. The Amer. Math. Monthly 92 (1985) 584-587