SHORTEST PATH TO A SEGMENT AND QUICKEST VISIBILITY QUERIES

• Main Authors: Arkin, Esther M., Efrat, Alon, Knauer, Christian, Mitchell, Joseph S. B., Polishchuk, Valentin, Rote, Guenter, Schlipf, Lena, Talvitie, Topi
• Other Authors: Univ Arizona, Comp Sci
• Language: en
• Published: CARLETON UNIV, DEPT MATHEMATICS & STATISTICS 2016
• Online Access: http://hdl.handle.net/10150/614771; http://arizona.openrepository.com/arizona/handle/10150/614771

31st International Symposium on Computational Geometry (SoCG 2015) === We show how to preprocess a polygonal domain with a fixed starting point s in order to answer efficiently the following queries: Given a point q, how should one move from s in order to see q as soon as possible? This query resembles the well-known shortest-path-to-a-point query, except that the latter asks for the fastest way to reach q, instead of seeing it. Our solution methods include a data structure for a different generalization of shortest-path-to-a-point queries, which may be of independent interest: to report efficiently a shortest path from s to a query segment in the domain.