Visibility with multiple reflections

Discrete and Computational Geometry

Volumn 20, Issue 1, 1998, Pages 61-78

  Aronov, B ^a   Davis, A R ^b   Dey, T K ^c   Pal, S P ^c   Prasad, D C ^c  

^a POLYTECHNIC UNIVERSITY   (United States)

^b ST JOHN'S UNIVERSITY   (United States)

^c INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032388329     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009378     Document Type: Article

References (33)

1. B. Aronov, A. R. Davis, T. K. Dey, S. P. Pal, and D. C. Prasad. Visibility with one reflection. Discrete Comput. Geom., 19(4):553-574, 1998.
2. J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., 28:643-647, 1979.
3. M. de Berg. Ray Shooting, Depth Orders and Hidden Surface Removal. Lecture Notes in Computer Science, vol. 703. Springer-Verlag, Berlin, 1993.
4. C. Boldrighini, M. Keane, and F. Marchetti. Billiards in polygons. Ann. Probab., 6:532-540, 1978.
5. M. Born and E. Wolf. Principles of Optics, 6th edn. Pergamon Press, Oxford, 1980.
6. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. Assoc. Comput. Mach., 39:1-54, 1992.
7. A. R. Davis. Visibility with Reflections in Triangulated Surfaces. Ph.D. thesis, Dept. Computer and Information Science, Polytechnic University, Brooklyn, NY, 1998.
8. H. N. Djidjev, A. Lingas, and J. Sack. An O(n log n) algorithm for computing the link center of a simple polygon. Discrete Comput. Geom., 8(2): 131-152, 1992.
9. H. Edelsbrunner, L. J. Guibas, and M. Sharir. The complexity and construction of many faces in arrangements of lines and of segments. Discrete Comput. Geom., 5:161-196, 1990.
10. H. ElGindy and D. Avis. A linear algorithm for computing the visibility polygon from a point. J. Algorithms, 2:186-197, 1981.
11. J. Foley, A. van Dam, S. Feiner, J. Hughes, and R. Phillips. Introduction to Computer Graphics. Addison-Wesley, Reading, MA, 1994.
12. R. Guenther. Modern Optics. Wiley, New York, 1990.
13. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
14. E. Gutkin, Billiards in polygons. Phys. D. 19:311-333, 1986.
15. A. Horn and F. Valentine. Some properties of /-sets in the plane. Duke Math. J., 16:131-140, 1949.
16. Y. Ke. An efficient algorithm for link-distance problems. Proc. 5th Annu. ACM Sympos. Comput. Geom., 1989, pp. 69-78.
17. Y. Ke. Polygon Visibility Algorithms for Weak Visibility and Link Distance Problems. Ph.D. thesis, Dept. Computer Science, Johns Hopkins University, Baltimore, MD, 1989.
18. S. Kerckhoff, H. Masur, and J. Smillie. Ergodicity of billiard flows and quadratic differentials. Ann. of Math., 124:293-311, 1986.
19. V. Klee. Is every polygonal region illuminable from some point? Amer. Math. Monthly, 76:180, 1969.
20. V. Klee and S. Wagon. Old and New Unsolved Problems in Plane Geometry tind Number Theory. Mathematical Association of America, Washington, DC, 1991.
21. V. V. Kozlov and D. V. Treshchev. Billiards: A Genetic Introduction to the Dynamics of Systems with Impacts. Translations of Mathematical Monographs, vol. 89. American Mathematical Society, Providence, RI. 1991.
22. W. Lenhart, R. Pollack, J.-R. Sack, R. Seidel, M. Sharir, S. Suri, G. T. Toussaint, S. Whitesides, and C. K. Yap. Computing the link center of a simple polygon. Discrete Comput. Geom., 3:281-293, 1988.
23. J. Mitchell. Shortest paths and networks. In J. E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. Chapter 24, pp. 445-466. CRC Press, Boca Raton, FL, 1997.
24. I. Newton. Opticks, or A Treatise of the Reflections, Refractions, Inflections and Colours of Light, 4th edn. London, 1730.
25. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, 1987.
26. J. O'Rourke. Computational Geometry in C. Cambridge University Press, New York, 1994.
27. J. O'Rourke. Visibility. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pp. 467-479. CRC Press, Boca Raton, FL, 1997.
28. M. Pellegrini. Ray shooting and lines in space. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pp. 599-614. CRC Press, Boca Raton, FL, 1997.
29. D. C. Prasad, S. P. Pal, and T. K. Dey. Visibility with multiple diffuse reflections. Comput. Geom. Theory Appl., to appear, 1998.
30. J. Reif, J. Tygar, and A. Yoshida. Computability and complexity of ray tracing. Discrete Comput. Geom., 11:265-288, 1994.
31. T. C. Shermer. Recent results in art galleries. Proc. IEEE. 80(9):1384-1399, 1992.
32. S. Suri. On some link distance problems in a simple polygon. IEEE Trans. Robot. Automat., 6:108-113, 1990.
33. G. W. Tokarsky. Polygonal rooms not illuminable from every point. Amer. Math. Monthly, 102:867-879, 1995.