Skip to main content
Journal Article

Kinetic Dictionaries: How to Shoot a Moving Target

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2832 172-183
DOI: 10.1007/978-3-540-39658-1_18
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

De Berg, M. (2003). Kinetic Dictionaries: How to Shoot a Moving Target. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 172–183. https://doi.org/10.1007/978-3-540-39658-1_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free