Abstract
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.
Original language | English (US) |
---|---|
Title of host publication | Leibniz International Proceedings in Informatics, LIPIcs |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Pages | 658-673 |
Number of pages | 16 |
Volume | 34 |
ISBN (Print) | 9783939897835 |
DOIs | |
State | Published - Jun 1 2015 |
Event | 31st International Symposium on Computational Geometry, SoCG 2015 - Eindhoven, Netherlands Duration: Jun 22 2015 → Jun 25 2015 |
Other
Other | 31st International Symposium on Computational Geometry, SoCG 2015 |
---|---|
Country | Netherlands |
City | Eindhoven |
Period | 6/22/15 → 6/25/15 |
Keywords
- Continuous Dijkstra
- Path planning
- Persistent data structures
- Query structures and complexity
- Visibility
ASJC Scopus subject areas
- Software