References
- B. Aronov, L.J. Guibas, M. Teichmann, and L. Zhang, Visibility queries and maintenance in simple polygons, Discrete Comput. Geom. 27(4) (2002), pp. 461–483. doi: 10.1007/s00454-001-0089-9
- I.J. Balaban, An optimal algorithm for finding segment intersections, Proceedings of the 11th Annual ACM Symposium of Computational Geometry, 1995, pp. 211–219.
- P. Bose, A. Lubiw, and J.I. Munro, Efficient visibility queries in simple polygons, Comput. Geom. Theory Appl. 23(3) (2002), pp. 313–335. doi: 10.1016/S0925-7721(01)00070-0
- D.Z. Chen and H. Wang, Weak visibility queries of line segments in simple polygons, Proceedings of the 23rd International Symposium on Algorithms and Computation, 2012, pp. 609–618.
- D.Z. Chen and H. Wang, Computing the visibility polygon of an island in a polygonal domain, in Proceedings of the 39th International Colloquium on Automata, Languages and Programming, 2012, pp. 218–229.
- D.Z. Chen and H. Wang, Weak visibility queries of line segments in simple polygons, Comput. Geom. Theory Appl. (CGTA) 48(6) (2015), pp. 443–452. doi: 10.1016/j.comgeo.2015.02.001
- S.K. Ghosh, Visibility Algorithms in the Plane, Cambridge University Press, New York, NY, 2007.
- 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 (1987), pp. 209–233. doi: 10.1007/BF01840360
- A. Margalit and G.D. Knott, An algorithm for computing the union, intersection or difference of two polygons, Comput. Graph. 13 (1989), pp. 167–183. doi: 10.1016/0097-8493(89)90059-9
- M. Nouri Bygi and M. Ghodsi, Weak visibility queries in simple polygons, Proceedings of the 23rd Canadian Conference of Computational Geometry, CCCG 2011, Toronto ON, August 10–12, 2011. Available at http://cccg.ca/proceedings/2011/papers/paper95.pdf.
- M. Nouri Bygi and M. Ghodsi, Near optimal line segment queries in simple polygons, J. Discrete Algorithms 35 (2015), pp. 51–61. ISSN 1570-8667. Available at http://www.sciencedirect.com/science/article/pii/S1570866715001033. doi: 10.1016/j.jda.2015.10.002
- S. Suri and J. O'Rourke, Worst-case optimal algorithms for constructing visibility polygons with holes. Proceedings of the 2nd Annual Symposium on Computational Geometry, 1986, pp. 14–23.
- G.T. Toussaint, A linear-time algorithm for solving the strong hidden-line problem in a simple polygon, Pattern Recognit. Lett. 4 (1986), pp. 449–451. doi: 10.1016/0167-8655(86)90043-7
- A. Zarei and M. Ghodsi, Query point visibility computation in polygons with holes, Comput. Geom. Theory Appl. 39(2) (2008), pp. 78–90. doi: 10.1016/j.comgeo.2007.02.005