Illumination by floodlights

Computational Geometry: Theory and Applications

Volumn 10, Issue 1, 1998, Pages 57-70

  Steiger, William ^a   Streinu, Ileana ^b  

^a RUTGERS UNIVERSITY   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041125889     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00027-8     Document Type: Article

References (21)

1. D. Avis, H. ElGindy, Triangulating point sets in space, Discrete Comput. Geom. 2 (1987) 99-111.
2. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (1972) 448-461.
3. P. Bose, L. Guibas, A. Lubiw, M. Overmars, D. Souvaine, J. Urrutia, The floodlight problem, in: Proc. 5th Canadian Conference on Computational Geometry, 1993, pp. 399-404.
4. P. Bose, G. Toussaint, No quadrangulation is extremely odd, in: Proceedings ISAAC '95, Lecture Notes in Computer Science 1004, Springer, Berlin, 1995, pp. 372-381.
5. B. Chazelle, L. Guibas, D.T. Lee, The power of geometric duality, BIT 25 (1985) 76-90.
6. J. Czyzowicz, E. Rivera-Campo, J. Urrutia, Optimal floodlight illumination of stages, in: Proc. 5th Canadian Conference on Computational Geometry, 1993, pp. 393-398.
7. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.
8. H. Edelsbrunner, L. Guibas, Topologically sweeping an arrangement, in: Proc. 18th STOC, 1986, pp. 389-403.
9. H. Edelsbrunner, J. O'Rourke, R. Seidel, Constructing arrangements of lines and hyperplanes with applications, SIAM J. Comput. 15 (1986) 341-363.
10. V. Estivill-Castro, J. O'Rourke, J. Urrutia, D. Xu, Illumination of polygons with vertex floodlights, Inform. Process. Lett. 56 (1) (1995) 62-73.
11. V. Estivill-Castro, J. Urrutia, Optimal floodlight illumination of orthogonal art galleries, in: Proc. 6th Canadian Conference on Computational Geometry, 1994.
12. J.E. Goodman, R. Pollack, Allowable sequences and order types in discrete and computational geometry, DIMACS Tech. Report 92-1, in: J. Pach (Ed.), New Trends in Discrete and Computational Geometry, 1991.
13. D.Y. Grigor'ev, Complexity of deciding Tarski algebra, J. Symbolic Comput. 5 (1988) 65-108.
14. D.E. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973.
15. [15[ C.Y. Lo, J. Matoušek, W. Steiger, Algorithms for ham-sandwich cuts, Discrete Comput. Geom. 11 (4) (1994) 433.
16. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, Oxford, 1987.
17. F.P. Preparata, M. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.
18. S. Ramaswami, P. Ramos, G. Toussaint, Converting triangulations to quadrangulations, in: Proc. 7th Canadian Conference on Computational Geometry, 1995.
19. W. Steiger, I. Streinu, Positive and negative results on the floodlight problem, in: Proc. 6th Canadian Conference on Computational Geometry, 1994, pp. 87-92.
20. I. Streinu, Positive and negative results in computational geometry, Ph.D. Thesis, Rutgers University (1994).
21. A. Tarski, A Decision Method for Elementary Algebra and Geometry, University of California Press, Berkeley, 1948; 2nd ed. 1951.