Fully dynamic geometric spanners

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

Abstract

In this paper we present an algorithm for maintaining a geometric spanner over a dynamic set of points S. For a set S of points in Rd, a t-spanner is a sparse graph on the points of S such that there is a path in the spanner between any pair of points whose total length is at most t times the Euclidean distance between the points. In this paper we present the first fully dynamic algorithm for maintaining a geometric spanner whose update time depends solely on the number of points in S. In particular, we show how to maintain a (1 + ε)-spanner with O(n/εd) edges, where points can be inserted to S in an amortized update time of O(log n) and deleted from S in an amortized update time of ?O(n1/3).

Original languageEnglish
Title of host publicationProceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07
Pages373-380
Number of pages8
DOIs
StatePublished - 2007
Externally publishedYes
Event23rd Annual Symposium on Computational Geometry, SCG'07 - Gyeongju, Korea, Republic of
Duration: 6 Jun 20078 Jun 2007

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Conference

Conference23rd Annual Symposium on Computational Geometry, SCG'07
Country/TerritoryKorea, Republic of
CityGyeongju
Period6/06/078/06/07

Keywords

  • Algorithms
  • Dynamic
  • Geometry
  • Spanners

Fingerprint

Dive into the research topics of 'Fully dynamic geometric spanners'. Together they form a unique fingerprint.

Cite this