253 search results - page 1 / 51 » Dynamic Trees and Dynamic Point Location |
SIAMCOMP
1998
13 years 4 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
SODA
2008
ACM
13 years 5 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
SODA
1992
ACM
13 years 5 months ago
1992
ACM
INFOCOM
1997
IEEE
13 years 8 months ago
1997
IEEE
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...