Revision as of 15:32, 17 May 2012 edit Ringwith (talk \| contribs) 333 edits →Compactness ← Previous edit		Revision as of 15:32, 17 May 2012 edit undo Ringwith (talk \| contribs) 333 edits →Efficiency Next edit →
Line 34: ====Efficiency==== The ratio of the worst case number of events that can occur when the structure is advanced to <math>t=\infty</math> 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 ~~changed~~changes as time is advanced to <math>t=\infty</math>. A kinetic data structure is said to be efficient if this ratio is small. ==Types of Trajectories==

Kinetic data structure: Difference between revisions