Learn More
A box-tree is a \ifasci so-called \emph{bounding-volume hierarchy} \else bounding-volume hierarchy \fi that uses axis-aligned boxes as bounding volumes. The query complexity of a box-tree with respect to a given type of query is the maximum number of nodes visited when answering such a query. We describe several new algorithms for constructing box-trees(More)
In this paper we study on-demand source initiated protocols for mobile wireless networks. In particular, we study the flooding procedure commonly used by these protocols to set up temporary communication paths. The benefit of the flooding technique is its generosity regarding changes in network structure. On the other hand, each time a message is sent, the(More)
[A02] K Aberer. Scalable data access in peer-to-peer systems using unbalanced search trees. E Pavlov. A generic scheme for building overlay networks in adversarial scenarios. process on the hypercube with applications to peer-to-peer networks. Proc. [AN86] M Aizenman and C M Newman. Discontinuity of the percolation density in one dimensional 1/|x − y| 2(More)
A watchman route in a polygon P is a route inside P such that each point in the interior of P is visible from at least one point along the route. The objective of the shortest watchman route problem is to minimize the length of the watchman route for a given polygon. In 1991 Chin and Ntafos claimed an O(n 4) algorithm, solving the shortest watchman route(More)