An Optimal Algorithm for Range Search on Multidimensional Points

This paper proposes an efficient and novel method to address range search on multidimensional points in $\theta(t)$ time, where $t$ is the number of points reported in $\Re^k$ space. This is accomplished by introducing a new data structure, called BITS $k$d-tree. This structure also supports fast updation that takes $\theta(1)$ time for insertion and $O(\log n)$ time for deletion. The earlier best known algorithm for this problem is $O(\log^k n+t)$ time in the pointer machine model.

[1]  Stephen Alstrup,et al.  New data structures for orthogonal range searching , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2]  Pons Crespo,et al.  Design, Analysis and Implementation of New Variants of Kd-trees , 2010 .

[3]  Timothy M. Chan,et al.  Orthogonal range searching on the RAM, revisited , 2011, SoCG '11.

[4]  Hermann Tropf,et al.  Multimensional Range Search in Dynamically Balanced Trees , 1981, Angew. Inform..

[5]  K. S. Easwarakumar,et al.  BITS-Tree-An Efficient Data Structure for Segment Storage and Query Processing , 2013, BIOINFORMATICS 2013.

[6]  Stefan Nilsson,et al.  An Experimental Study of Compression Methods for Dynamic Tries , 2002, Algorithmica.

[7]  Maarten Löffler,et al.  Range Searching , 2016, Encyclopedia of Algorithms.

[8]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[9]  Chak-Kuen Wong,et al.  Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees , 1977, Acta Informatica.

[10]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[11]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[12]  Mark H. Overmars,et al.  Dividedk-d trees , 2005, Algorithmica.

[13]  Hanan Samet,et al.  A consistent hierarchical representation for vector data , 1986, SIGGRAPH.

[14]  Dan E. Willard,et al.  New Data Structures for Orthogonal Queries. , 1979 .

[15]  Jack A. Orenstein.  Multidimensional Tries Used for Associative Searching , 1982, Inf. Process. Lett..

[16]  Jon Louis Bentley,et al.  Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.

[17]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[18]  Timothy M. Chan.  Persistent predecessor search and orthogonal point location on the word RAM , 2011, SODA '11.

[19]  Yakov Nekrich.  Orthogonal Range Searching in Linear and Almost-Linear Space , 2007, WADS.

[20]  Kasper Green Larsen,et al.  Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model , 2012, SoCG '12.

[21]  Jim Euchner.  Design , 2014, Catalysis from A to Z.

[22]  Bradford G. Nickerson,et al.  A deterministic skip list for k-dimensional range search , 2005, Acta Informatica.

[23]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.