We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We show that for any set of n moving points in ℜd and any parameter 2≤k≤n, one can select a fixed non-empty subset of the points of size O(klogk), such that the Voronoi diagram of this subset is ``balanced'' at any given time (i.e., it contains O(n/k) points per cell). We also show that the bound O(klogk) is near optimal even for the one dimensional case in which points move linearly in time. As an application, we show that one can assign communication radii to the sensors of a network of n moving sensors so that at any given time, their interference is O(nlogn). This is optimal up to an O(logn) factor. In order to obtain these results, we extend well-known results from ε-net theory to kinetic environments
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.