A Clustering-Based Approach to Kinetic Closest Pair

作者：Rahmati Zahed^*; Chan Timothy M

来源：Algorithmica, 2018, 80(10): 2742-2756.

DOI：10.1007/s00453-017-0338-9

• Kinetic data structure
• Clustering
• Closest pair
• All nearest neighbors
• Moving points

Given a set P of n moving points in fixed dimension d, where the trajectory of each point is a polynomial of degree bounded by some constant, we present a kinetic data structure (KDS) for maintenance of the closest pair on P. Assuming the closest pair distance is between 1 and over time, our KDS uses space and processes events, each in worst-case time . Here, is an extremely slow-growing function. The locality of the KDS is . Our closest pair KDS supports insertions and deletions of points. An insertion or deletion takes worst-case time . Also, we use a similar approach to provide a KDS for the all -nearest neighbors in . The complexities of the previous KDSs, for both closest pair and all -nearest neighbors, have polylogarithmic factors, where the number of logs depends on dimension d. Assuming is polynomial in n, our KDSs obtain improvements on the previous KDSs. Our solutions are based on a kinetic clustering on P. Though we use ideas from the previous clustering KDS by Hershberger, we simplify and improve his work.

• 出版日期2018-10