| Share |
|
| Follow | |
We present a proximity data structure for a set of points that can be updated smoothly as the points move.
Many applications require repeated computation of proximity information of a set of moving points. The discrete center hierarchy data structure allows the maintenance of such information.
