1. |
- Arkin, Esther M, et al.
(author)
-
Shortest path to a segment and quickest visibility queries
- 2016
-
In: LIPIcs-Leibniz International Proceedings in Informatics. ; , s. 77-100
-
Conference paper (peer-reviewed)abstract
- We show how to preprocess a polygonal domain with a xed starting point s in order to answer eciently 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 shortestpath- 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 di erent generalization of shortest-path-to-a-point queries, which may be of independent interest: to report eciently a shortest path from s to a query segment in the domain.
|
|