共 50 条
- [33] Balanced aspect ratio trees:: Combining the advantages of k-d trees and octrees JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 38 (01): : 303 - 333
- [35] Resilient k-d trees: k-means in space revisited Frontiers of Computer Science, 2012, 6 : 166 - 178
- [36] On the average cost of insertions on random relaxed K-d trees PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 194 - 200
- [38] Balanced Aspect Ratio trees:: Combining the advantages of k-d trees and octrees PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 300 - 309
- [39] 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), 2000, 1879 : 179 - 190