Guarding the walls of an art gallery

Visual Computer

Volumn 15, Issue 6, 1999, Pages 265-278

  Laurentini, Aldo ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER VISION; PROBLEM SOLVING;

ART GALLERY PROBLEMS;

COMPUTATIONAL GEOMETRY;

EID: 0032597988     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003710050177     Document Type: Article

References (21)

1. Baase S (1988) Computer algorithms. Addison-Wesley, New York
2. Bjorling-Sachs I, Souvaine DL (1995) An efficient algorithm for guard placement in polygons with holes. Discrete Comput Geom 13:77-109
3. Chvátal V ( 1975) A combinatorial theorem in plane geometry. J Combinat Theor, Series B 18:39-41
4. Culberson JC, Reckhow RA (1994) Covering polygons is hard. J Algorithms 17:2-44
5. Edelsbrunner H (1987) Algorithms in combinatorial geometry. Springer, Berlin, Heidelberg
6. Fisk S (1978) Short proof of Chvatal's Watchman Theorem. J Combinat Theor, Series B 24:374
7. Gigus Z, Canny J, Seidel R (1991) Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Trans Patt Anal Machine Intell 13:542-551
8. Gualtieri JA, Baugher S, Werman M (1989) The visual potential: one convex polygon. Comput Vision Graph Image Processing 46:96-130
9. Hoffmann F, Kaufmann M, Kriegel K (1991) The art gallery theorem for polygons with holes. Proceedings of the 32nd Symposium of Foundations of Computer Science, pp. 39-48
10. Laurentini A (1996) Guarding the walls of an art gallery. Internal Report, Politecnico di Torino, Italy
11. Lee D, Lin A (1986) Computational complexity of art gallery problems. IEEE Trans Inform Theor IT-32:276-282
12. Muroga S (1979) Logic design and switching theory. John Wiley, New York, Chapt. 4
13. Nemhauser G, Wolsey L (1988) Integer and combinatorial optimization. John Wiley, New York, pp. 466
14. O'Rourke J, Supowit K (1983) Some NP-hard polygon decomposition problems. IEEE Trans Inform Theor IT-29:181-190
15. O'Rourke J (1987) Art gallery theorems and algorithms. Oxford University Press, New York
16. Parker RG, Rardin RL (1988) Discrete optimization. Academic Press, San Diego, p. 37
17. Plantinga H, Dyer CR (1990) Visibility, occlusion and the aspect graph. Int J Comput Vision 5:137-160
18. Preparata F, Shamos M (1985) Computational geometry: an introduction. Springer, Berlin, Heidelberg, New York
19. Salkin HM, Mathur K (1989) Foundations of integer programming. Elsevier, New York, Chapt. 13
20. Shermer T (1992) Recent results in art galleries. IEEE Proc 80:1384-1399
21. Urrutia J (1996) Art gallery and illumination problems. In: Sack JR, Urrutia J (eds) Handbook of computational geometry, Internal Report, Ottawa University, Canada