Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235437] of Pankaj K. Agarwal

Papers Published

  1. Agarwal, PK; Berg, MD; Gudmundsson, J; Hammar, M; Haverkort, HJ, Box-trees and R-trees with near-optimal query time, in Seventeenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (2001), pp. 124-133
    (last updated on 2017/12/15)

    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 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 algorithms to convert box-trees to R-trees, resulting in R-trees with (almost) optimal query complexity.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320