Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Caroline M. Eastman. Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees. Inf. Process. Lett., 12(4):165-167, 1981.

@article{Eastman81,
  title = {Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees},
  author = {Caroline M. Eastman},
  year = {1981},
  researchr = {https://researchr.org/publication/Eastman81},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {12},
  number = {4},
  pages = {165-167},
}

runs on WebDSL