Abstract. Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, thr...
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
The paper presents a scheme for serving dynamic resources over the Internet. The method uses a combination of structured fragmentation of dynamic resources in a tree hierarchy and...
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...