Kinetic closest pair
A kinetic closest pair data structure is a kinetic data structure that maintains the closest pair of points, given a set P of n points that are moving continuously with time in a metric space. While many efficient algorithms were known in the static case, they proved hard to kinetize,[1] so new static algorithms were developed to solve this problem.
2D case
Approach 1
The simplest kinetic approach for maintenance of the closest pair is to use variants of the Delaunay triangulations.[2]
Consider a hexagon and partition it into six equilateral triangles, and then create a Delaunay triangulation based on each equilateral triangle, as each one is a convex shape. The union of these six Delaunay triangulations, so called Equilateral Delaunay graph (EDG), is a supergraph for the nearest neighbor graph (NNG); the endpoints of the edge with minimum length in EDG gives the closest pair. It is straightforward to maintain Delaunay triangulations based on convex shapes. Given the EDG over time, by creating a kinetic tournament tree over the edges of the EDG, one can easily maintain the closest pair.
This closest pair KDS is efficient, amortized responsive, and compact, but in general is not local. The following approach presents a local KDS for maintenance of the closest pair.
Approach 2
The second kinetic approach is based on the following observations.[3][4]
Divide and conquer
If the space around a point p is divided angularly into six "wedges", each 60° wide, the closest point to p is the closest of the closest points in each of the wedges. The rest of this article will focus on the "main" wedges (those bisected by the x-axis), and symmetrical arguments will apply to the other wedges after rotating the plane by ±60°.
Matched points
Points p and q are said to be "matched" if they are the closest points to each other. Clearly, the closest pair of points is a matched pair.
Consider points p and q, such that p is to the left of q and q lies in the wedge centered at p described above. If p is the closest point to q, then q must be the closest point (in this wedge) to p, in the x-direction. Thus, the set of pairs of closest points (within this wedge) in the x-direction is a superset of the set of pairs of closest points.
Construction
- Map each point p=(x, y) in the set P to a new point p' = (u, v) = (x+√3y, y-√3x), forming the set P' of transformed points. Note that for a point p, the points in the "main" wedges have u and v coordinates either larger or smaller than p' in this new coordinate system.
- Sort the points by x,u and v coordinates, and store them in kinetic sorted lists.
- Construct a 2D range tree T on the points in P'. For every node w in the primary tree, let T(w) be the secondary tree associated with w. This range tree will be used to identify the points in the "main" wedge for a point w.
- For every node w in the primary tree, and every node e in T(w), calculate the pair π(w, e) = (b, r), where b (or r) is defined to be the point with maximum (or minimum) x-coordinate in the left (or right) subtree of e. Let Π(0) be the set of π(w, e) for all pairs w, e in T. This is a superset of the set of pairs of closest points (within the main wedge).
- Build a kinetic priority queue on the pairs in Π(0), with priorities determined by the distance (measured in the original co-ordinate system) between the points in the pair.
- Repeat the above steps for the plane rotated ±60°, to get kinetic priority queues on Π(1) and Π(-1) respectively.
The closest pair of points in P corresponds to the minimum of the minimums obtained from the three priority queues Π above.
Maintenance
Certificate failures can occur in the priority queues and the sorted lists. Swaps in the ordering of the points will cause changes to T (which will take O(log2 n) time), and may cause insertions/deletions in the priority queues.
Note that the number of changes to the sets Π as defined above need not be a constant number. However, any pair that starts or stops being matched as a result of the ordering of p and q changing must contain p and/or q, and hence there are only a constant number of matched pairs that must be inserted into/deleted from the priority queues. It is ok to only update these matched pairs since, by definition, only matched pairs have a chance of being the closest pair.
Analysis
This KDS is:
- Responsive: takes O(log2 n) time to process an event
- Local: since each point is present in a constant number of kinetic sorted lists and kinetic priority queues, locality follows from the locality of those structures
- Compactness: compactness follows from the compactness of the kinetic sorted lists and kinetic priority queues
- Efficient: every swap in the sorted lists causes a constant number of insertions and deletions in the kinetic priority queues. Assuming the motion of the points is pseudo-algebraic, there are a polynomial number of swaps, and hence a polynomial number of events are processed by this KDS, making it efficient
This approach can be used to maintain the closest pair in higher dimensions.
References
- ↑ Basch, J., Guibas, L. J., Hershberger, J (1997). "Data structures for mobile data". SODA. Society for Industrial and Applied Mathematics. pp. 747–756. http://dl.acm.org/citation.cfm?id=314435. Retrieved May 17, 2012.
- ↑ Rahmati, Z.; King, V.; Whitesides, S. (2013). "Kinetic data structures for all nearest neighbors and closest pair in the plane". Proceedings of the 29th ACM Symposium on Computational Geometry. pp. 137–144. doi:10.1145/2462356.2462378.
- ↑ Basch, Julien; Guibas, Leonidas J.; Zhang, Li (1997). "Proximity problems on moving points". Proceedings of the 13th ACM Symposium on Computational Geometry. pp. 344–351.
- ↑ Agarwal, P.K.; Kaplan, Haim; Sharir, Micha (November 2008). "Kinetic and dynamic data structures for closest pair and all nearest neighbors". Transactions on Algorithms (TALG) 5 (1). http://dl.acm.org/citation.cfm?id=1435379.
 |  |
