References

Afshani, P., L. Arge and K.G. Larsen, 2012. Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. Proceedings of the 28th Annual ACM Symposium on Computational Geometry, June 17-20, 2012, ACM, New York, USA., ISBN: 978-1-4503-1299-8, pp: 323-332.

Alstrup, S., G.S. Brodal and T. Rauhe, 2000. New data structures for orthogonal range searching. Proceedings of the 41st Annual Symposium on Foundations of Computer Science, November 12-14, 2000, IEEE, Redondo Beach, California, ISBN: 0-7695-0850-2, pp: 198-207.

Bentley, J.L. and J.B. Saxe, 1979. Decomposable searching problems. Inf. Process. Lett., 8: 5-9.
Direct Link  |  

Bentley, J.L., 1975. Multidimensional binary search trees used for associative searching. Commun. ACM, 18: 509-517.
CrossRef  |  Direct Link  |  

Bentley, J.L., 1979. Multidimensional binary search trees in database applications. Software Eng. IEEE. Trans., 4: 333-340.
CrossRef  |  

Bentley, J.L., 1980. Multidimensional divide-and-conquer. Commun. ACM., 23: 214-229.
CrossRef  |  Direct Link  |  

Chan, T.M., K.G. Larsen and M. Patrascu, 2011. Orthogonal range searching on the RAM, revisited. Proceedings of the 27th Annual Symposium on Computational Geometry, June 13-15, 2011, ACM, New York, USA., ISBN: 978-1-4503-0682-9, pp: 1-10.

Crespo, M.M.P., 2010. Design, analysis and implementation of new variants of Kd-trees. Master Thesis, Polytechnic University of Catalonia, Barcelona, Spain.

De Berg, M., O. Cheong, M. Van Kreveld and M. Overmars, 2008. Computational Geometry: Algorithms and Applications. 3rd Edn., Springer, New York, ISBN-13: 9783540779735, Pages: 386.

Devroye, L., J. Jabbour and Z.C. Cura, 2000. Squarish kd trees. SIAM. J. Comput., 30: 1678-1700.
CrossRef  |  Direct Link  |  

Easwarakumar, K.S. and T. Hema, 2015. BITS-tree-an efficient data structure for segment storage and query processing. Int. J. Comput. Technol., 11: 3108-3116.
Direct Link  |  

Kreveld, M.J.V. and M.H. Overmars, 1991. Dividedk-d trees. Algorithmica, 6: 840-858.
CrossRef  |  Direct Link  |  

Lamoureux, M.G. and B.G. Nickerson, 1995. Deterministic skip lists for K-dimensional range search. University of New Brunswick Technical Report TR95-098, Revision, 1.

Lee, D.T. and C.K. Wong, 1977. Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Acta Inf., 9: 23-29.
CrossRef  |  Direct Link  |  

Nekrich, Y., 2009. Orthogonal range searching in linear and almost-linear space. Comput. Geom., 42: 342-351.
CrossRef  |  Direct Link  |  

Nelson, R.C. and H. Samet, 1986. A consistent hierarchical representation for vector data. Proceedings of the Conference on ACM SIGGRAPH Computer Graphics, August 4, 1986, ACM, New York, USA., ISBN:0-89791-196-2, pp: 197-206.

Nilsson, S. and M. Tikkanen, 2002. An experimental study of compression methods for dynamic tries. Algorithmica, 33: 19-33.
CrossRef  |  Direct Link  |  

Orenstein, J.A., 1982. Multidimensional tries used for associative searching. Inf. Process. Lett., 14: 150-157.

Preparata, F. and M.I. Shamos, 1985. Computational Geometry: An Introduction. Springer-Verlag, New York.

Samet, H., 1974. Fundamentals of Multi-Dimensional and Metric Data Structures. Academic Press, New York, USA..

Samet, H., 1990. The Design and Analysis of Spatial Data Structures. Addition Wesley, New York.

Tropf, H. and H. Herzog, 1981. Multidimensional range search in dynamically balanced trees. Angew. Inf., 2: 71-77.
Direct Link  |  

Willard, D., 1978. New Data Structures for Orthogonal Queries. Harvard University, Harvard University, Pages: 38.