Efficient computation of query point visibility in polygons with holes

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 314-320

  Zarei, Alireza ^a   Ghodsi, Mohammad ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Polygon with holes; Visibility decomposition; Visibility polygon

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; PROBLEM SOLVING;

POLYGON WITH HOLES; VISIBILITY DECOMPOSITION; VISIBILITY POLYGON;

QUERY LANGUAGES;

EID: 33244458670     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064140     Document Type: Conference Paper

References (17)

1. T. Asano. Efficient algorithms for finding the visibility polygons for a polygonal region with holes. In Manuscript. Department of Electrical Engineering and Computer Science, University of California at Berkeley, 1984.
2. M. T. B. Aronov, L Guibas and L. Zhang. Visibility queries and maintenance in simple polygons. Discrete and Computational Geometry, 27(4):461-483, 2002.
3. J. Bentley and T. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers, 28:643-647, 1979.
4. B. Chazelle and L. Guibas. Visibility and intersection problems in plane geometry. In Proc. 1th Annu. ACM Sympos. Comput. Geom., pages 135-156, 1985.
5. H. Gindy and D. Avis. A linear algorithm for computing the visibility polygon from a point. Journal of Algorithms, 2:186-197, 1981.
6. P. J. Heffernan and J. S. B. Mitchell. An optimal algorithm for computing visibility in the plane. SIAM Journal of Computing, 24(1):184-201, 1995,
7. D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal of Computing, 12(1);28-35, 1983.
8. D. L. M. S. L. Guibas, J. Hershberger and R. Tarjan. Linear time algorithms for visibility and shortest path problems inside simple polygons. In Proc. Second Annual ACM Symp. on Computational Geometry, pages 1-13, 1986.
9. R. M. L. Guibas and P. Raghavan. The robot localization problem in two dimensions. SIAM Journal of Computing, 26(4):1120-1138, 1997.
10. D. Lee. Visibility of a simple polygon. Computer vision, Graphics, and Image Processing, 22(1):207-221, 1983.
11. D. Lee and F. Preparata. Location of a point in a planar subdivision and its applications. SIAM Journal of Computing, 6(3):594-606, 1977.
12. M. O. Mark de Berg, Marc van Kreveld and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 2000.
13. A. L. P. Bose and J. I. Munro. Efficient visibility queries in simple polygons. Computational Geometry: Theory and Applications, 23(3):313-335, 2002.
14. M. Pocchiola and G. Vegter. The visibility complex. Internat. J. Comput. Geom. Appl., 6(3):279308, 1996.
15. F. Preparata. A new approach to planar point location. SIAM Journal of Computing, 10(3):473-482, 1981.
16. N. Sarnak and R. Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29(7):669-679, 1986.
17. S. Suri and J. O'Rourke. Worst-case optimal algorithms for constructing visibility polygons with holes. In Proc. of the second annual symposium on Computational geometry, pages 14-23, 1986.