Abstract
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 language | English GB |
|---|---|
| Pages (from-to) | 344-355 |
| Number of pages | 12 |
| Journal | Nordic Journal of Computing |
| Volume | 11 |
| Issue number | 4 |
| State | Published - 2004 |