Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer. Computing the k-Crossing Visibility Region of a Point in a Polygon. In Charles J. Colbourn, Roberto Grossi, Nadia Pisanti, editors, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Volume 11638 of Lecture Notes in Computer Science, pages 10-21, Springer, 2019. [doi]
@inproceedings{BahooBDS19,
title = {Computing the k-Crossing Visibility Region of a Point in a Polygon},
author = {Yeganeh Bahoo and Prosenjit Bose and Stephane Durocher and Thomas C. Shermer},
year = {2019},
doi = {10.1007/978-3-030-25005-8_2},
url = {https://doi.org/10.1007/978-3-030-25005-8_2},
researchr = {https://researchr.org/publication/BahooBDS19},
cites = {0},
citedby = {0},
pages = {10-21},
booktitle = {Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings},
editor = {Charles J. Colbourn and Roberto Grossi and Nadia Pisanti},
volume = {11638},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-25005-8},
}