@InProceedings{wang:LIPIcs.SoCG.2017.61, author = {Wang, Haitao}, title = {{Quickest Visibility Queries in Polygonal Domains}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {61:1--61:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.61}, URN = {urn:nbn:de:0030-drops-71863}, doi = {10.4230/LIPIcs.SoCG.2017.61}, annote = {Keywords: shortest paths, visibility, quickest visibility queries, shortest path to segments, polygons with holes} }