Kinetic Dictionaries: How to Shoot a Moving Target

A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point q whether q ∈ S. We study trade-offs between the worst-case query time in a kinetic dictionary and the total cost of maintaining it during the motions of the points.

• Type: Conference
• Year: 2003
• Where: ESA
• Authors: Mark de Berg
• Keywords: Data Structure, ESA 2003, Kinetic Dictionary, Worst-case Query Time