Kinetic data structure: Difference between revisions

Content deleted Content added
Ringwith (talk | contribs)
No edit summary
Ringwith (talk | contribs)
No edit summary
Line 6:
Kinetic data structures are used on systems were there are 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 <math>v</math>, it is known that <math>v=f(t)</math>.
Kinetic data structures allow queries on a system at the current virtual time <math>t</math>, and two additional operations:
*'''<math>\textrm{advance}(t)</math>''': This advances the system to time <math>t</math>.
*'''<math>\textrm{change}(v,f(t))</math>''': Set the trajectory of value <math>v</math> to <math>f(t)</math>.
Additional operations may be supported. For example, kinetic data structures are often used with a set of points. In this case, the structure typically allow points to be inserted and deleted.