@InProceedings{buchin_et_al:LIPIcs.ISAAC.2022.58,
author = {Buchin, Kevin and Custers, Bram and van der Hoog, Ivor and L\"{o}ffler, Maarten and Popov, Aleksandr and Roeloffzen, Marcel and Staals, Frank},
title = {{Segment Visibility Counting Queries in Polygons}},
booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
pages = {58:1--58:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-258-7},
ISSN = {1868-8969},
year = {2022},
volume = {248},
editor = {Bae, Sang Won and Park, Heejin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.58},
URN = {urn:nbn:de:0030-drops-173431},
doi = {10.4230/LIPIcs.ISAAC.2022.58},
annote = {Keywords: Visibility, Data Structure, Polygons, Complexity}
}