Abstract
The stage illumination problem presented by Urrutia in 1992 is one of illumination problems, which uses floodlights for illuminating a stage. The problem asks whether or not it is possible to rotate given floodlights around their apexes so as to obtain a final configuration such that a given stage is completely illuminated. The problem for finding a polynomial time algorithm for this problem or proving NP-hardness of this problem was open. This paper shows that it is NP-complete even with some restrictions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Fransisco (1979)
Urrutia, J.: Art gallery and illumination problems. In: Proceedings of Discrete and Computational Geometry Workshop 1997, Tokai University, pp. 1-57 (1997)
Urrutia, J.: Art gallery and illumination problems. In: Sack, J.R., Urrutia, J. (eds.) Art gallery and illumination problems. Handbook on Computational Geometry, Elsevier Science Publishers, Amsterdam, (to appear) a draft is in, http://www.site.uottawa.ca/~jorge/online_papers/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, H., Uehara, H., Yokoyama, M. (2000). NP-Completeness of Stage Illumination Problems. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-46515-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67181-7
Online ISBN: 978-3-540-46515-7
eBook Packages: Springer Book Archive