Efficient computation of query point visibility in polygons with holes

Alireza Zarei, Mohammad Ghodsi. Efficient computation of query point visibility in polygons with holes. In Joseph S. B. Mitchell, Günter Rote, editors, Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005. pages 314-320, ACM, 2005. [doi]

@inproceedings{ZareiG05,
  title = {Efficient computation of query point visibility in polygons with holes},
  author = {Alireza Zarei and Mohammad Ghodsi},
  year = {2005},
  doi = {10.1145/1064092.1064140},
  url = {http://doi.acm.org/10.1145/1064092.1064140},
  researchr = {https://researchr.org/publication/ZareiG05},
  cites = {0},
  citedby = {0},
  pages = {314-320},
  booktitle = {Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005},
  editor = {Joseph S. B. Mitchell and Günter Rote},
  publisher = {ACM},
  isbn = {1-58113-991-8},
}