Shortest Path to a Segment and Quickest Visibility Queries

Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S B Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish (US)
Title of host publicationLeibniz International Proceedings in Informatics, LIPIcs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages658-673
Number of pages16
Volume34
ISBN (Print)9783939897835
DOIs
StatePublished - Jun 1 2015
Event31st International Symposium on Computational Geometry, SoCG 2015 - Eindhoven, Netherlands
Duration: Jun 22 2015Jun 25 2015

Other

Other31st International Symposium on Computational Geometry, SoCG 2015
CountryNetherlands
CityEindhoven
Period6/22/156/25/15

Fingerprint

Visibility
Data structures

Keywords

  • Continuous Dijkstra
  • Path planning
  • Persistent data structures
  • Query structures and complexity
  • Visibility

ASJC Scopus subject areas

  • Software

Cite this

Arkin, E. M., Efrat, A., Knauer, C., Mitchell, J. S. B., Polishchuk, V., Rote, G., ... Talvitie, T. (2015). Shortest Path to a Segment and Quickest Visibility Queries. In Leibniz International Proceedings in Informatics, LIPIcs (Vol. 34, pp. 658-673). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SOCG.2015.658

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 proceedingConference contribution

Arkin, EM, Efrat, A, Knauer, C, Mitchell, JSB, Polishchuk, V, Rote, G, Schlipf, L & Talvitie, T 2015, Shortest Path to a Segment and Quickest Visibility Queries. in Leibniz International Proceedings in Informatics, LIPIcs. vol. 34, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 658-673, 31st International Symposium on Computational Geometry, SoCG 2015, Eindhoven, Netherlands, 6/22/15. https://doi.org/10.4230/LIPIcs.SOCG.2015.658
Arkin EM, Efrat A, Knauer C, Mitchell JSB, Polishchuk V, Rote G et al. Shortest Path to a Segment and Quickest Visibility Queries. In Leibniz International Proceedings in Informatics, LIPIcs. Vol. 34. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2015. p. 658-673 https://doi.org/10.4230/LIPIcs.SOCG.2015.658
Arkin, Esther M. ; Efrat, Alon ; Knauer, Christian ; Mitchell, Joseph S B ; Polishchuk, Valentin ; Rote, Günter ; Schlipf, Lena ; Talvitie, Topi. / Shortest Path to a Segment and Quickest Visibility Queries. Leibniz International Proceedings in Informatics, LIPIcs. Vol. 34 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2015. pp. 658-673
@inproceedings{5b01d00ad68d412e834e123300e85367,
title = "Shortest Path to a Segment and Quickest Visibility Queries",
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.",
keywords = "Continuous Dijkstra, Path planning, Persistent data structures, Query structures and complexity, Visibility",
author = "Arkin, {Esther M.} and Alon Efrat and Christian Knauer and Mitchell, {Joseph S B} and Valentin Polishchuk and G{\"u}nter Rote and Lena Schlipf and Topi Talvitie",
year = "2015",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.SOCG.2015.658",
language = "English (US)",
isbn = "9783939897835",
volume = "34",
pages = "658--673",
booktitle = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

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 -