K-D trees are better when cut on the longest side

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 179-190

  Dickerson, Matthew ^a   Duncan, Christian A ^b   Goodrich, Michael T ^c  

^a MIDDLEBURY COLLEGE   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; NEAREST NEIGHBOR SEARCH; DATA STRUCTURES;

BINARY SPATIAL PARTITIONING; DATA DISTRIBUTION; GEOMETRIC QUERIES; K-D TREE; POLYLOGARITHMIC; POLYLOGARITHMIC TIME; RANGE SEARCHING; STANDARD ALGORITHMS;

TREES (MATHEMATICS);

EID: 84927134406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_17     Document Type: Article

References (19)

1. S. Arya and D. M. Mount. Approximate range searching. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 172-181, 1995.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 573-582, 1994.
3. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
4. J. L. Bentley. K-d trees for semidynamic point sets. In Proc. 6th Annu. ACM Sympos. Comput. Geom., pages 187-197, 1990.
5. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
6. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput., 17:427-462, 1988.
7. J. R. Driscoll, H. N. Gabow, R. Shrairaman, and R. E. Tarjan. Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Commun. ACM, 31:1343-1354, 1988.
8. C. A. Duncan. Balanced Aspect Ratio Trees. Ph.D. thesis, Dept. of Computer Science, Johns Hopkins Univ., 1999.
9. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Balanced aspect ratio trees and their use for drawing very large graphs. In Proc. Graph Drawing ’98, LNCS 1547, pages 111-124. Springer-Verlag, 1998.
10. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. In Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 300-309, 1999.
11. M. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization problems. J. ACM, 34:596-615, 1987.
12. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3:209-226, 1977.
13. D. T. Lee and C. K. Wong. Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Acta Inform., 9:23-29, 1977.
14. S. Maneewongvatana and D. M. Mount. It’s okay to be skinny, if your friends are fat. In 4th Annual CGC Workshop on Computational Geometry, 1999.
15. M. H. Overmars and J. van Leeuwen. Dynamic multi-dimensional data structures based on quad- and k-d trees. Acta Inform., 17:267-285, 1982.
16. Y. V. Silva Filho. Average case analysis of region search in balanced k-d trees. Inform. Process. Lett., 8:219-223, 1979.
17. Y. V. Silva Filho. Optimal choice of discriminators in a balanced k-d binary search tree. Inform. Process. Lett., 13:67-70, 1981.
18. R. F. Sproull. Refinements to nearest-neighbor searching. Algorithmica, 6:579-589, 1991.
19. M. J. van Kreveld and M. H. Overmars. Divided k-d trees. Algorithmica, 6:840-858, 1991.