Competitive query strategies for minimising the ply of the potential locations of moving points
William Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals · 2013
We study the problem of maintaining the locations of a collection of n entities that are moving with some fixed upper bound on their speed. We assume a setting where we may query the current location of entities, but handling this query takes a certain unit of time, during which we cannot query any other entities. In this model, we can never know the exact locations of all entities at any one time. Instead, we maintain a representation of the potential locations of all entities. We measure the quality of this representation by its ply: the maximum over all points p of the number of entities that could potentially be at p.