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 Scopus citations


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
Number of pages16
ISBN (Print)9783939897835
StatePublished - Jun 1 2015
Event31st International Symposium on Computational Geometry, SoCG 2015 - Eindhoven, Netherlands
Duration: Jun 22 2015Jun 25 2015


Other31st International Symposium on Computational Geometry, SoCG 2015


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

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Shortest Path to a Segment and Quickest Visibility Queries'. Together they form a unique fingerprint.

Cite this