volume 28, issue 3, P291-312 2002
DOI: 10.1007/s00454-002-2817-1
View full text
|
|
Share

Abstract: ABSTRACTA 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 ar…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
37
1

Publication Types

Select...

Relationship

0
0

Authors

Journals