Boris Aronov
- ADD+95.B. Aronov, A. R. Davis, T. K. Dey, S. P. Pal, and D. C. Prasad. Visibility with multiple reflection. In preparation, 1995.Google Scholar
- AK87.J. Arvo and D. B. Kirk. Fast ray tracing by ray classification. In Maureen C. Stone, editor, Computer Graphzcs (SIGGRAPH'87 Proceedings), volume 21, pages 55-64, July 1987. Google ScholarDigital Library
- BO79.J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28:643-647, 1979.Google ScholarDigital Library
- DPP95.T. K. Dey, S. P. Pal, and D. C. Prasad. Art gallery problems for visibility with reflection. In preparation, 1995.Google Scholar
- EA81.H. E1Gindy and D. Avis. A linear algorithm for computing the visibility polygon from a point. Y. Algorithms, 2:186-197, I981.Google ScholarCross Ref
- FKN80.H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph., 14:124-133, 1980. Google ScholarDigital Library
- GHL+87.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. Algorilhmica, 2:209-233, 1987.Google ScholarDigital Library
- Gut86.E. Gutkin. Billiards in polygons. Phys~ca D, 19:311-333, 1986. Google ScholarDigital Library
- HV49.A. Horn and F. Valentine. Some properties of /-sets in the plane. Duke Mathematics Journal, 16:131- 140, 1949.Google ScholarCross Ref
- Ke89.Y. Ke. An efficient algorithm for link-distance problems. In Proc. 5th Annu. A CM $ympos. Comput. Geom., pages 69-78, 1989. Google ScholarDigital Library
- KW91.V. Klee and S. Wagon. Old and New Unsolved Problems in Plane Geomegry and Number Theory. Mathematical Association of America, 1991.Google Scholar
- Lee83.D.T. Lee. Visibility of a simple polygon. Cornput. Vision Graph. Image Process., 22:207-221, 1983.Google ScholarCross Ref
- LL86.D. Lee and A. Lin. Computational complexity of art gallery problems. IEEE Trans. Inform. Theory, 32:276-282, 1986. Google ScholarDigital Library
- LPS+88.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.Google ScholarDigital Library
- O'R87.J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987. Google ScholarDigital Library
- RTY94.J. R~eif, J. Tygar, and A. Yoshida. Computability and complexity of ray tracing. Distr. ~'; Comput. Geom., 11:265-288, 1994.Google ScholarDigital Library
- She92.T. C. Shermer. Recent results in art galleries. Proc. IEEE, 80(9):1384-1399, September 1992.Google ScholarCross Ref
- Sur87.S. Suri. Minimum link paths in polygons and related problems. Ph.D. thesis, Dept. C~omput. Sci., johns Hopkins Univ., Baltimore, MD, 1987. Google ScholarDigital Library
- Sur90.S. Suri. On some link distance problems in a simple polygon. IEEE Trans. Robot. Aurora., 6:108- 113, 1990.Google ScholarCross Ref
Index Terms
- Visibility with reflection
Recommendations
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
AbstractWe devise an algorithm for maintaining the visibility polygon of any query point in a dynamic polygonal domain, i.e., as the polygonal domain is modified with vertex insertions and deletions to its obstacles, we update the data structures that ...
Visibility and ray shooting queries in polygonal domains
Given a polygonal domain (or polygon with holes) in the plane, we study the problem of computing the visibility polygon of any query point. As a special case of visibility problems, we also study the ray-shooting problem of finding the first point on ...
Comments