Dynamic Algorithms for Approximating Interdistances

Sergey Bereg, Michael Segal

Research output: Contribution to journalArticlepeer-review


In this paper we present efficient dynamic algorithms for approximation of kth, 1 ≤ k ≤ (n 2) distance defined by some pair of points from a given set S of n points in d-dimensional space. Our technique is based on the dynamization of well-separated pair decomposition proposed in [11], computing approximate nearest and farthest neighbors [22, 25] and use of persistent search trees [17].
Original languageEnglish GB
Pages (from-to)344-355
Number of pages12
JournalNordic Journal of Computing
Issue number4
StatePublished - 2004


Dive into the research topics of 'Dynamic Algorithms for Approximating Interdistances'. Together they form a unique fingerprint.

Cite this