Multidimensional Orthogonal Range Search Using Tries

We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to solve the orthogonal range search problem in k dimensions, requires linear space, and supports dynamic operations. An expected time analysis of the algorithm indicates it is competitive with the best known k-d range search algorithms when k is large (i.e. k ≈ log n).

• Type: Conference
• Year: 2003
• Where: CCCG
• Authors: Lingke Bu, Bradford G. Nickerson
• Keywords: CCCG 2003, CCCG 2007, K-d Range Search, K-d Rectangles, Range Search Algorithms