@InProceedings{chan:LIPIcs.SoCG.2017.27,
  author =	{Chan, Timothy M.},
  title =	{{Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back}},
  booktitle =	{33rd International Symposium on Computational Geometry (SoCG 2017)},
  pages =	{27:1--27:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-038-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{77},
  editor =	{Aronov, Boris and Katz, Matthew J.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.27},
  URN =		{urn:nbn:de:0030-drops-72262},
  doi =		{10.4230/LIPIcs.SoCG.2017.27},
  annote =	{Keywords: computational geometry, data structures, range searching, nearest neighbor searching}
}