Abstract
A box-tree is a bounding-volume hierarchy 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 with small worst-case query complexity with
... read more