Visibility with One Reflection

Discrete and Computational Geometry

Volumn 19, Issue 4, 1998, Pages 553-574

  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: 0032365648     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009368     Document Type: Article

References (26)

1. B. Aronov, A. R. Davis, T. K. Dey, S. P. Pal, and D. C. Prasad. Visibility with multiple reflections. Discrete Comput. Geom. To appear.
2. B. Aronov and M. Teichmann. Online maintenance of visibility and shortest-path information. Manuscript, 1994.
3. D. Avis and G. T. Toussaint. An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans. Comput., 30:910-1014, 1981.
4. J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., 28:643-647, 1979.
5. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J.. Assoc. Comput. Mach., 39:1-54, 1992.
6. A. R. Davis. Visibility with Reflections in Triangulated Surfaces. Ph.D. thesis, Dept. Comput. Inf. Sci., Polytechnic University, Brooklyn, NY. In preparation.
7. 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.
8. H. ElGindy and D. Avis. A linear algorithm for computing the visibility polygon from a point. J. Algorithms, 2:186-197, 1981.
9. H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph., 14:124-133, 1980.
10. 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.
11. E. Gutkin. Billiards in polygons. Phys. D, 19:311-333, 1986.
12. A. Horn and F. Valentine. Some properties of I-sets in the plane. Duke Math. J., 16:131-140, 1949.
13. Y. Ke. An efficient algorithm for link-distance problems. In Proc. 5th Ann. ACM Symp. Comput. Geom., pages 69-78, 1989.
14. V. Klee and S. Wagon. Old and New Unsolved Problems in Plane Geometry and Number Theory. Mathematical Association of America, Washington, DC, 1991.
15. D. Lee and A. Lin. Computational complexity of art gallery problems. IEEE Trans. Inform. Theory, 32:276-282, 1986.
16. D. T. Lee. Visibility of a simple polygon. Comput. Vision Graph. Image Process., 22:207-221, 1983.
17. 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.
18. J. Mitchell. Shortest paths and networks. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 24, pages 445-466. CRC Press, Boca Raton, FL, 1997.
19. J. S. B. Mitchell and S. Suri. Geometric algorithms. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Models, Handbook of Operations Research/Management Science, pages 425-479. Elsevier, Amsterdam, 1995.
20. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, 1987.
21. J. O'Rourke. Visibility. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 467-479. CRC Press, Boca Raton, FL, 1997.
22. D. C. Prasad. New Visibility Problems: Combinatorial and Computational Complexities. Ph.D. thesis, Dept. Comput. Sci. Engrg., Indian Institute of Technology, Kharagpur, 1997.
23. D. C. Prasad, S. P. Pal, and T. K. Dey. Visibility with multiple diffuse reflections. Comput. Geom. Theory Appl. To appear.
24. J. Reif, J. Tygar, and A. Yoshida. Computability and complexity of ray tracing. Discrete Comput. Geom., 11:265-288, 1994.
25. T. C. Shermer. Recent results in art galleries. Proc. IEEE, 80(9): 1384-1399, Sept. 1992.
26. J. Urrutia. Art gallery and illumination problems. In J.-R. Sack and J. Urrutia, editors, Handbook on Computational Geometry. North-Holland, Amsterdam. To appear.