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 , computing approximate nearest and farthest neighbors [22, 25] and use of persistent search trees .
|Original language||English GB|
|Number of pages||12|
|Journal||Nordic Journal of Computing|
|State||Published - 2004|