Let s be a point in a polygonal domain P of h − 1 holes and n vertices. We consider a quickest visibility query problem. Given a query point q in P, the goal is to find a shortest path in P to move from s to see q as quickly as possible. Previously, Arkin et al. (SoCG 2015) built a data structure of size O(n 2 2 α(n) log n) that can answer each query in O(K log 2 n) time, where α(n) is the inverse Ackermann function and K is the size of the visibility polygon of q in P (and K can be Θ(n) in the worst case). In this paper, we present a new data structure of size O(n log h + h 2 ) that can answer each query in O(h log h log n) time. Our result improves the previous work when h is relatively small. In particular, if h is a constant, then our result even matches the best result for the simple polygon case (i.e., h = 1), which is optimal. As a by-product, we also have a new algorithm for a shortest-pathto-segment query problem. Given a query line segment τ in P, the query seeks a shortest path from s to all points of τ . Previously, Arkin et al. gave a data structure of size O(n 2 2 α(n) log n) that can answer each query in O(log 2 n) time, and another data structure of size O(n 3 log n) with O(log n) query time. We present a data structure of size O(n) with query time O(h log n h ), which also favors small values of h and is optimal when h = O(1).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.