Illumination by floodlights

@article{Steiger1998IlluminationBF,
  title={Illumination by floodlights},
  author={William L. Steiger and Ileana Streinu},
  journal={Comput. Geom.},
  year={1998},
  volume={10},
  pages={57-70}
}
We consider three problems about the illumination of planar regions with oodlights of prescribed angles. Problem 1 is the decision problem: given a wedge W of angle , n points p 1 ; ; p n in the plane and n angles 1 ; ; n summing up to , decide whether W can be illuminated by oodlights of angles 1 ; ; n placed in some order at the points p 1 ; ; p n and then rotated appropriately. We show that this problem is in exponential time and a specialized version of it (when =) is in NP. The second… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Complexity of Deciding Tarski Algebra

  • D. Y. Grigor'ev
  • Journal of Symbolic Computation,5,
  • 1988
Highly Influential
4 Excerpts

J

  • C. Y. Lo
  • Matou sek and W. Steiger, Algorithms for Ham…
  • 1994

Positive and Negative Results in Computational Geometry

  • I. Streinu
  • PhD Thesis, Rutgers University,
  • 1994

Similar Papers

Loading similar papers…