Dynamic algorithms for approximating interdistances

Sergei Bespamyatnikh, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this paper we present efficient dynamic algorithms for approximation of kth, 1 ≤ k ≤ (2n) distance defined by some pair of points from a given set S of n points in d-dimensional space, for every fixed d. Our technique is based on dynamization of well-separated pair decomposition proposed in [11], computing approximate nearest and farthest neighbors [23,26] and use of persistent search trees [18].

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsJos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger
PublisherSpringer Verlag
Pages1169-1180
Number of pages12
ISBN (Print)3540404937, 9783540404934
DOIs
StatePublished - 1 Jan 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2719
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Dynamic algorithms for approximating interdistances'. Together they form a unique fingerprint.

Cite this