Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich. K-D Trees Are Better when Cut on the Longest Side. In Mike Paterson, editor, Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Volume 1879 of Lecture Notes in Computer Science, pages 179-190, Springer, 2000.
@inproceedings{DickersonDG00,
title = {K-D Trees Are Better when Cut on the Longest Side},
author = {Matthew Dickerson and Christian A. Duncan and Michael T. Goodrich},
year = {2000},
researchr = {https://researchr.org/publication/DickersonDG00},
cites = {0},
citedby = {0},
pages = {179-190},
booktitle = {Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings},
editor = {Mike Paterson},
volume = {1879},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-41004-X},
}