Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs

Fabian Gieseke, Justin Heinermann, Cosmin E. Oancea, Christian Igel. Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs. In Proceedings of the 31th International Conference on Machine Learning, ICML 2014, Beijing, China, 21-26 June 2014. Volume 32 of JMLR Proceedings, pages 172-180, JMLR.org, 2014. [doi]

@inproceedings{GiesekeHOI14,
  title = {Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs},
  author = {Fabian Gieseke and Justin Heinermann and Cosmin E. Oancea and Christian Igel},
  year = {2014},
  url = {http://jmlr.org/proceedings/papers/v32/gieseke14.html},
  researchr = {https://researchr.org/publication/GiesekeHOI14},
  cites = {0},
  citedby = {0},
  pages = {172-180},
  booktitle = {Proceedings of the 31th International Conference on Machine Learning, ICML 2014, Beijing, China, 21-26 June 2014},
  volume = {32},
  series = {JMLR Proceedings},
  publisher = {JMLR.org},
}