% Nearest neighbours
% See also geometry and buckets

@inproceedings
 {ck,
  author="P. Callaghan and S. Rao Kosaraju",
  title="A decomposition of multi-dimensional point-sets with
         applications to $k$-nearest-neighbours and $n$-body
         potential fields",
  booktitle="ACM STOC",
  address="Victoria (Canada)",
  year="1992",
  pages=""
}


@article
 {b,
  author="M. Bern",
  title="Approximate closest-point  queries in high dimensions",
  journal="Information Procesing Letters",
  year="1993",
  volume="45",
  number="",
  pages="95-99"
}

@article
 {ms,
  author="M. Smid",
  title="Maintaining the minimal distance o a point set in 
         polylogarithmic time",
  journal="Discrete and Computational Geometry",
  year="1992",
  volume="7",
  number="",
  pages="415-431"
}

@inproceedings
 {,
  author="S. Arya and others",
  title="An optimal algorithm for approximate nearest neighbor searching",
  booktitle="ACM SODA",
  address="",
  year="1994",
  pages=""
}

@inproceedings
 {,
  author="K. Clarkson",
  title="An algorithm for approximate closest-point queries",
  booktitle="ACM SoCG",
  address="",
  year="1994",
  pages=""
}


@inproceedings
 {,
  author="P. Yianilos",
  title="Data structures and algorithms for nearest neighbor
search in general metric spaces",
  booktitle="ACM SODA",
  address="Austin, Texas",
  year="1993",
  pages=""
}

@inproceedings
 {klei-97,
  author="J. Kleinberg",
  title="Two algorithms for nearest-neighbour search in 
         high dimension",
  booktitle="ACM STOC",
  address="El Paso, Texas, USA",
  year="1997",
  pages=""
}

@inproceedings
 {,
  author="S. Bespamyatnikh",
  title="An optimal algorithm for closest pair maintenance",
  booktitle="ACM SoCG",
  address="Vancouver, Canada",
  year="1995",
  pages=""
}

@article
 {,
  author="J. Uhlmann",
  title="Metric trees",
  journal="Appl. Math. Letters",
  year="1991",
  volume="4",
  number="5",
  pages=""
}

@article
 {,
  author="C. Feustel",
  title="The nearest neighbor problem in an abstract metric space",
  journal="Pattern Recognition Letters",
  year="1982",
  volume="1",
  number="",
  pages=""
}

@article
 {,
  author="B. Kim and S. Park",
  title="A fast $k$ neighbor finding algorithm based on the ordered partition",
  journal="IEEE Trans. on Pattern Analysis and Machine Intelligence",
  year="1986",
  volume="8",
  number="6",
  pages=""
}

@inproceedings
 {,
  author="J. Jaromczyk and M. Kowaluk",
  title="A note on relative neighborhood graphs",
  booktitle="ACM SoCG",
  address="",
  year="1987",
  pages=""
}

@article
 {,
  author="R. Sproull",
  title="Refinments to nearest-neighbor searching in $k$-dimensional trees",
  journal="Algorithmica",
  year="1991",
  volume="6",
  number="",
  pages=""
}

@article
 {,
  author="G. Toussaint",
  title="The relative neighborhood graph of a finite planar set",
  journal="Pattern Recognition",
  year="1980",
  volume="12",
  number="4",
  pages=""
}

@article
 {,
  author="J. Friedman and JL. Bentley and R. Ari Finkel",
  title="An algorithm for finding best matches in logarithmic expected time",
  journal="ACM Trans. on Math. Software",
  year="1977",
  volume="3",
  number="3",
  pages=""
}