License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2021.2
URN: urn:nbn:de:0030-drops-154352
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15435/
Go to the corresponding LIPIcs Volume Portal

Bose, Prosenjit

Spanning Properties of Variants of the Delaunay Graph (Invited Talk)

pdf-format:
LIPIcs-ISAAC-2021-2.pdf (0.3 MB)

Abstract

A weighted geometric graph G is a graph whose n vertices are points in the plane and whose m edges are line segments weighted by the Euclidean distance between their endpoints. A t-spanner of G is a connected spanning subgraph G' with the property that for every pair of vertices x, y, the shortest path from x to y in G' has weight at most t ≥ 1 times the shortest path from x to y in G. The parameter t is commonly referred to as the spanning ratio or the stretch factor. Typically, G is a graph with Ω(n²) edges. As such, the goal in this area is to construct a subgraph G' that possesses several desirable properties such as O(n) edges and spanning ratio close to 1. In addition, when planarity is one of the desired properties, variants of Delaunay graphs play a vital role in the construction of planar geometric spanners. In this talk, we will provide a comprehensive overview of various results concerning the spanning ratio, among other several other properties, of different types of Delaunay graphs and their subgraphs.

BibTeX - Entry

@InProceedings{bose:LIPIcs.ISAAC.2021.2,
  author =	{Bose, Prosenjit},
  title =	{{Spanning Properties of Variants of the Delaunay Graph}},
  booktitle =	{32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
  pages =	{2:1--2:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-214-3},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{212},
  editor =	{Ahn, Hee-Kap and Sadakane, Kunihiko},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/15435},
  URN =		{urn:nbn:de:0030-drops-154352},
  doi =		{10.4230/LIPIcs.ISAAC.2021.2},
  annote =	{Keywords: Delaunay Graph, Geometric Graph, Graph Spanner}
}

Keywords: Delaunay Graph, Geometric Graph, Graph Spanner
Collection: 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Issue Date: 2021
Date of publication: 30.11.2021

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