Visibility with multiple diffuse reflections

Computational Geometry: Theory and Applications

Volumn 10, Issue 3, 1998, Pages 187-196

  Prasad, D Chithra ^a   Pal, Sudebkumar P ^a,b,c   Dey, Tamal K ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b Rajiv Gandhi Foundation   (India)

^c JAWAHARLAL NEHRU CENTRE FOR ADVANCED SCIENTIFIC RESEARCH   (India)

Author keywords

Combinatorial complexity; Diffuse reflection; Visibility

Indexed keywords

EID: 0040757612     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00021-7     Document Type: Article

References (16)

1. B. Aronov, A. Davis, T.K. Dey, S.P. Pal, D.C. Prasad, Visibility with reflection, in: Proceedings of the Eleventh Annual ACM Symposium on Computational Geometry, 1995, pp. 316-325.
2. B. Aronov, A. Davis, T.K. Dey, S.P. Pal, D.C. Prasad, Visibility with multiple reflections, in: Proceedings of the Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 1097, 1996, pp. 284-295.
3. J.L. Bentley, T. Ottmann, Algorithms for counting and reporting geometric intersections, IEEE Trans. Comput. 28 (1979) 643-647.
4. H.N. Djidjev, A. Lingas, J.R. Sack, An o(n log n) algorithm for computing a link center in a simple polygon, in: Proceedings of Sixth Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 349, 1989, pp. 96-107.
5. H. ElGindy, D. Avis, A linear algorithm for computing the visibility polygon from a point, J. Algorithms 2 (1981) 186-197.
6. S.K. Ghosh, Computing the visibility polygon from a convex set and related problems, J. Algorithms 12 (1991) 75-95.
7. L. Guibas, J. Hershberger, D. Leven, M Sharir, R. Tarjan, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
8. Y. Ke, An efficient algorithm for link distance problems, in: Proceedings of the Fifth Annual ACM Symposium on Computational Geometry, 1989, pp. 69-78.
9. D.T. Lee, Visibility of a simple polygon, Comput. Vision Graphics Image Processing 22 (1983) 207-221.
10. D.T. Lee, A.K. Lin, Computing the visibility polygon from an edge, Comput. Vision Graphics Image Processing 34 (1986) 1-19.
11. W. Lenhart, R. Pollack, J. Sack, R. Seidal, M. Sharir, S. Suri, G. Toussaint, S. Whitesides, C. Yap, Computing the link center of a simple polygon, Discrete Comput. Geom. 3 (1988) 281-293.
12. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, Oxford, 1987.
13. D.C. Prasad, New visibility problems: Combinatorial and computational complexities, Ph.D. Thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India, 1996.
14. T. Shermer, Recent results in art galleries, Proceedings of the IEEE 80 (1992) 1384-1399.
15. S. Suri, A linear time algorithm for minimum link paths inside a simple polygon, Comput. Vision Graphics Image Processing 35 (1986) 99-110.
16. S. Suri, Minimum link paths in polygons and related problems, Ph.D. Thesis, Department of Computer Science, Johns Hopkins University, Baltimore, MD, 1987.