Timothy M. Chan. Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. In Boris Aronov, Matthew J. Katz, editors, 33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia. Volume 77 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{Chan17a,
title = {Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back},
author = {Timothy M. Chan},
year = {2017},
doi = {10.4230/LIPIcs.SoCG.2017.27},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2017.27},
researchr = {https://researchr.org/publication/Chan17a},
cites = {0},
citedby = {0},
booktitle = {33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia},
editor = {Boris Aronov and Matthew J. Katz},
volume = {77},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-038-5},
}