No abstract

By using primers based on the sequence of a species-specific antigen of Helicobacterpylori (P. O'Toole, S. M.

A box-tree is a bounding-volume hierarchy that uses axisaligned 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 with small worst-case query complexity with respect to queries with axis-parallel boxes and with points. We also prove lower bounds on the worst-case query complexity for box-trees, which show that our results are optimal or close to optimal. Finally, we present algorithn^ to convert box-trees to R-trees, resulting in R-trees with (almost) optimal query complexity.

No abstract

A box-tree is a bounding-volume hierarchy that uses axisaligned 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 with small worst-case query complexity with respect to queries with axis-parallel boxes and with points. We also prove lower bounds on the worst-case query complexity for box-trees, which show that our results are optimal or close to optimal. Finally, we present algorithn^ to convert box-trees to R-trees, resulting in R-trees with (almost) optimal query complexity.