Kinetic data structure

A kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously.^[1][2][3][4] For example, a kinetic convex hull data structure maintains the convex hull of a group of n {\displaystyle n} moving points. The development of kinetic data structures was motivated by computational geometry problems involving physical objects in continuous motion, such as collision or visibility detection in robotics, animation or computer graphics.

Kinetic data structures are used on systems where there is a set of values that are changing as a function of time, in a known fashion. So the system has some values, and for each value v {\displaystyle v} , it is known that v = f ( t ) {\displaystyle v=f(t)} . Kinetic data structures allow queries on a system at the current virtual time t {\displaystyle t} , and two additional operations:

• advance ( t ) {\displaystyle {\textrm {advance}}(t)} : Advances the system to time t {\displaystyle t} .
• change ( v , f ( t ) ) {\displaystyle {\textrm {change}}(v,f(t))} : Alters the trajectory of value v {\displaystyle v} to f ( t ) {\displaystyle f(t)} , as of the current time.

Additional operations may be supported. For example, kinetic data structures are often used with a set of points. In this case, the structure typically allows points to be inserted and deleted.

A kinetic data structure allows the values stored in it to change continuously with time. In principle, this can be approximated by sampling the position of the points at fixed intervals of time, and deleting and re-inserting each point into a "static" (traditional) data structure. However, such an approach is vulnerable to oversampling or undersampling, depending on what interval of time is used, and can also be wasteful of computational resources.

The following general approach can be used to construct kinetic data structures:^[5]

1. Store a data structure on the system at the current time t {\displaystyle t} . This data structure allows queries on the system at the current virtual time.
2. Augment the data structure with certificates. Certificates are conditions under which the data structure is accurate. The certificates are all true now, and the data structure will only cease to be accurate when one of the certificates is no longer true.
3. Compute the failure time of each certificate, the time when it will cease to be true.
4. Store the certificates in a priority queue, keyed by their failure times
5. To advance to time t {\displaystyle t} , look at the certificate with the lowest failure time from the priority queue. If the certificate fails before time t {\displaystyle t} , pop it from the queue and fix the data structure so it is accurate at the time of failure, and update the certificates. Repeat this until the certificate with the lowest failure time in the priority queue fails after time t {\displaystyle t} . If the certificate with the lowest failure time in the priority queue fails after time t {\displaystyle t} , then all certificates are true at time t {\displaystyle t} so the data structure can correctly answer queries at time t {\displaystyle t} .

Certificate failures are referred to as "events". An event is considered internal if the property maintained by the kinetic data structure does not change when the event occurs. An event is considered external if the property maintained by the data structure changes when the event occurs.

When using the certificates approach, there are four measures of performance. We say a quantity is small if it is a polylogarithmic function of n {\displaystyle n} , or is O ( n ϵ ) {\displaystyle O(n^{\epsilon })} for arbitrarily small ϵ {\displaystyle \epsilon } , where n {\displaystyle n} is the number of objects:

Responsiveness is the worst case amount of time required to fix the data structure and augmenting certificates when a certificate fails. A kinetic data structure is responsive if the worst case amount of time required for an update is small.

The maximum number of certificates any one value is involved in. For structures involving moving points, this is that maximum number of certificates any one point is involved in. A kinetic data structure is local if the maximum number of certificates any one value is involved with is small.

The maximum number of certificates used to augment the data structure at any time. A kinetic data structure is compact if the number of certificates it uses is O ( n polylog ⁡ n ) {\displaystyle O(n\operatorname {polylog} n)} or O ( n 1 + ϵ ) {\displaystyle O(n^{1+\epsilon })} for arbitrarily small ϵ {\displaystyle \epsilon } . (a small factor more than linear space)

The ratio of the worst case number of events that can occur when the structure is advanced to t = ∞ {\displaystyle t=\infty } to the worst case number of "necessary changes" to the data structure. The definition of "necessary changes" is problem dependent. For example, in the case of a kinetic data structure maintaining the kinetic hull of a set of moving points, the number of necessary changes would be the number of times the kinetic hull changes as time is advanced to t = ∞ {\displaystyle t=\infty } . A kinetic data structure is said to be efficient if this ratio is small.

The performance of a certain kinetic data structure may be analyzed for certain types of trajectories. Typically, the following types of trajectories are considered:

• Affine:(Linear functions) f ( t ) = a t + b {\displaystyle f(t)=at+b}
• Bounded-degree algebraic:(Polynomial functions of bounded degree) f ( t ) = ∑ i = 0 n a i t i {\displaystyle f(t)=\sum _{i=0}^{n}a_{i}t^{i}} for some fixed n {\displaystyle n} .
• Pseudo-algebraic: Trajectories such that any certificate of interest flips between true and false O ( 1 ) {\displaystyle O(1)} times.

• Kinetic tournament
• Kinetic sorted list
• Kinetic heap
• Kinetic convex hull
• Kinetic closest pair
• Kinetic minimum spanning tree
• Kinetic Euclidean minimum spanning tree