Data structures for moving objects

(Agarwal; Har-Peled)


We developed algorithms for maintaining extents of moving objects approximately. In order to perform large-scale simulations on complex objects in real time, they are replaced by simpler objects, e.g., by a hierarchy of bounding boxes or by a hierarchy of smallest enclosing balls. Even maintaining the smallest enclosing box or ball is expensive --- the combinatorial structure might change several times. We proposed and implemented a simple, practical technique to maintain such structures approximately.