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 |
Fingerprint
Keywords
- Continuous Dijkstra
- Path planning
- Persistent data structures
- Query structures and complexity
- Visibility
ASJC Scopus subject areas
- Software
Cite this
Shortest Path to a Segment and Quickest Visibility Queries. / Arkin, Esther M.; Efrat, Alon; Knauer, Christian; Mitchell, Joseph S B; Polishchuk, Valentin; Rote, Günter; Schlipf, Lena; Talvitie, Topi.
Leibniz International Proceedings in Informatics, LIPIcs. Vol. 34 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2015. p. 658-673.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Shortest Path to a Segment and Quickest Visibility Queries
AU - Arkin, Esther M.
AU - Efrat, Alon
AU - Knauer, Christian
AU - Mitchell, Joseph S B
AU - Polishchuk, Valentin
AU - Rote, Günter
AU - Schlipf, Lena
AU - Talvitie, Topi
PY - 2015/6/1
Y1 - 2015/6/1
N2 - 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.
AB - 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.
KW - Continuous Dijkstra
KW - Path planning
KW - Persistent data structures
KW - Query structures and complexity
KW - Visibility
UR - http://www.scopus.com/inward/record.url?scp=84958171530&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84958171530&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.SOCG.2015.658
DO - 10.4230/LIPIcs.SOCG.2015.658
M3 - Conference contribution
AN - SCOPUS:84958171530
SN - 9783939897835
VL - 34
SP - 658
EP - 673
BT - Leibniz International Proceedings in Informatics, LIPIcs
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ER -