License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2020.52
URN: urn:nbn:de:0030-drops-133963
URL: https://drops.dagstuhl.de/opus/volltexte/2020/13396/
Go to the corresponding LIPIcs Volume Portal


Oh, Eunjin

Shortest-Path Queries in Geometric Networks

pdf-format:
LIPIcs-ISAAC-2020-52.pdf (0.6 MB)


Abstract

A Euclidean t-spanner for a point set V ⊂ ℝ^d is a graph such that, for any two points p and q in V, the distance between p and q in the graph is at most t times the Euclidean distance between p and q. Gudmundsson et al. [TALG 2008] presented a data structure for answering ε-approximate distance queries in a Euclidean spanner in constant time, but it seems unlikely that one can report the path itself using this data structure. In this paper, we present a data structure of size O(nlog n) that answers ε-approximate shortest-path queries in time linear in the size of the output.

BibTeX - Entry

@InProceedings{oh:LIPIcs:2020:13396,
  author =	{Eunjin Oh},
  title =	{{Shortest-Path Queries in Geometric Networks}},
  booktitle =	{31st International Symposium on Algorithms and Computation (ISAAC 2020)},
  pages =	{52:1--52:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-173-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{181},
  editor =	{Yixin Cao and Siu-Wing Cheng and Minming Li},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13396},
  URN =		{urn:nbn:de:0030-drops-133963},
  doi =		{10.4230/LIPIcs.ISAAC.2020.52},
  annote =	{Keywords: Shortest path, Euclidean spanner, data structure}
}

Keywords: Shortest path, Euclidean spanner, data structure
Collection: 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Issue Date: 2020
Date of publication: 04.12.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI