Energy-aware stage illumination

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 336-345

  Eisenbrand, Friedrich ^a   Karrenbauer, Andreas ^a   Funke, Stefan ^b   Matijevic, Domagoj ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Stanford University   (United States)

Author keywords

Art gallery problems; Illumination problem; Optimization.

Indexed keywords

ATTENUATION; ILLUMINATING ENGINEERING; LIGHT SOURCES; MATHEMATICAL MODELS; OPTIMIZATION;

ART GALLERY PROBLEMS; CONVEX OPTIMIZATION; ILLUMINATION PROBLEM; LIGHT ATTENUATION MODEL;

PROBLEM SOLVING;

EID: 33244461963     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064144     Document Type: Conference Paper

References (13)

1. L. Aleksandrov, A. Maheshwari, and J.-R. Sack. Approximation algorithms for geometric shortest path problems. In Proc. 32nd Annu. ACM Sympos. Theory Comput, pages 286-295, 2000.
2. N. Amenta, M. Bern, and D. Eppstein. The crust and the β-skeleton: Combinatorial curve reconstruction. Graphical models and image processing: GMIP, 60 (2):125-135, 1998.
3. G. Csizmadia and G. Tóth. Note on an art gallery problem. Comput. Geom. Theory Appl, 10(1):47-55, 1998.
4. J. Czyzowicz, E. Rivera-Campo, and J. Urrutia. Optimal floodlight illumination of stages. In Proc. 5th Canad. Conf. Comput. Geom., pages 393-398, 1993.
5. L. Fejes-Tóth. Illumination of convex disks. In Acta Math. Acad. Sci. Hungar. 29, pages 355-360, 1977.
6. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. 1988.
7. J. Kahn, M. M. Klawe, and D. Kleitman. Traditional galleries require fewer watchmen. SIAM J. Algebraic Discrete Methods, 4:194-206, 1983.
8. D. Lee and A. Lin. Computational complexity of art gallery problems. IEEE Trans. Inform. Theory, 32(2):276-282, 1986.
9. C. H. Papadimitriou. An algorithm for shortest-path motion in three dimensions. Inform. Process. Lett., 20:259-263, 1985.
10. B. Speckmann and C. D. Toth. Allocating vertex π-guards in simple polygons via pseudo-triangulations. In Proc. 14th ann. ACM-SIAM symp. on Discr. Alg., pages 109-118. SIAM, 2003.
11. C. D. Toth. Art gallery problems with guards whose range of vision is 180°. Comput. Geom. Theory Appl, 17:121-134, 2000.
12. J. Urrutia. Art gallery and illumination problems. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 973-1027. North-Holland, 2000.
13. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.