@inproceedings{AMN94
, author =	"S. Arya and D. M. Mount and N. Netanyahu and R.
		Silverman and A. Y. Wu"
, title =	"An Optimal Algorithm for Approximate Nearest Neighbor
		Searching in Fixed Dimensions"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"573--582"
}

@article{AMN98
, author =	"S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman
		and A. Wu"
, title =	"An Optimal Algorithm for Approximate Nearest Neighbor
		Searching"
, journal =	"J. ACM"
, volume =	45
, year =	1998
, pages =	"891--923"
}

@inproceedings{AMN95
, author =	"S. Arya and D. M. Mount and O. Narayan"
, title =	"Accounting for boundary effects in nearest neighbor
		searching"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"336--344"
}

@inproceedings{ArM93
, author =	"S. Arya and D. M. Mount"
, title =	"Approximate Nearest Neighbor Queries in Fixed
		Dimensions"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"271--280"
, update =	"93.05 smid"
}

@inproceedings{ArM93b
, author =	"S. Arya and D. M. Mount"
, title =	"Algorithms for fast vector quantization"
, booktitle =	"Proc. of DCC '93: Data Compression Conference"
, editor =	"J. A. Storer and M. Cohn"
, publisher =	"IEEE Press"
, year =	1993
, pages =	"381--390"
}

@inproceedings{ArM95
, author =	"S. Arya and D. M. Mount"
, title =	"Approximate Range Searching"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"172--181"
}

@inproceedings{Ben90
, author =	"J. L. Bentley"
, title =	"{K}-d trees for semidynamic point sets"
, booktitle =	"Proc. 6th Ann. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"187--197"
}

@article{Ber93
, author =	"M. Bern"
, title =	"Approximate closest-point queries in high dimensions"
, journal =	"Inform. Process. Lett."
, volume =	"45"
, year =	1993
, pages =	"95--99"
, update =	"93.05 smid"
}

@inproceedings{Bes95
, author =	"S. N. Bespamyatnikh"
, title =	"An optimal algorithm for closest pair maintenance"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"152--161"
}

@article{BWY80
, author =	"J. L. Bentley and B. W. Weide and A. C. Yao"
, title =	"Optimal expected-time algorithms for closest point
		problems"
, journal =	"ACM Transactions on Mathematical Software"
, year =	1980
, volume =	"6"
, number =	"4"
, pages =	"563--580"
}

@inproceedings{CaK92
, author =	"P. B. Callahan and S. R. Kosaraju"
, title =	"A decomposition of multi-dimensional point-sets with
		applications to $k$-nearest-neighbors and $n$-body
		potential fields"
, booktitle =	"Proc. 24th Ann. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"546--556"
}

@inproceedings{CaK95
, author =	"P. B. Callahan and S. R. Kosaraju"
, title =	"Algorithms for dynamic closest pair and $n$-body
		potential fields"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"263--272"
}

@inproceedings{Cha97
, author =	"T. Chan"
, title =	"Approximate Nearest Neighbor Queries Revisited"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"352--358"
, update =	"97.07 efrat"
}

@inproceedings{Cla83
, author =	"K. L. Clarkson"
, title =	"Fast algorithms for the all nearest neighbors
		problem"
, booktitle =	"Proc. 24th Ann. IEEE Sympos. on the Found. Comput.
		Sci."
, year =	1983
, pages =	"226--232"
}

@article{Cla88
, author =	"K. L. Clarkson"
, title =	"A randomized algorithm for closest-point queries"
, journal =	"SIAM Journal on Computing"
, year =	1988
, volume =	"17"
, number =	"4"
, pages =	"830--847"
}

@inproceedings{Cla94
, author =	"K. L. Clarkson"
, title =	"An Algorithm for Approximate Closest-Point Queries"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"160--164"
, update =	"94.01 jones"
}

@inproceedings{Cla97
, author =	"K. L. Clarkson"
, title =	"Nearest Neighbor Queries in Metric Spaces"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC 97"
, year =	1997
, pages =	"609--617"
, update =	"97.07 agarwal"
}

@article{Cle79
, author =	"J. G. Cleary"
, title =	"Analysis of an algorithm for finding nearest neighbors
		in {E}uclidean space"
, journal =	"ACM Transactions on Mathematical Software"
, year =	1979
, volume =	"5"
, number =	"2"
, pages =	"183--192"
}

@article{DDS92
, author =	"M. T. Dickerson and R. L. Drysdale and J. R. Sack"
, title =	"Simple algorithm for enumerating interpoint distances
		and finding $k$ nearest neighbors"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"2"
, number =	"3"
, year =	1992
, pages =	"221--239"
, keywords =	"enumeration, selection, Delaunay triangulation
		nearest neighbo rs"
, succeeds =	"dd-ekdnp-91"
}

@Book{Ede87
, author =	"H. Edelsbrunner"
, title =	"Algorithms in Combinatorial Geometry"
, series =	"EATCS Monographs on Theoretical Computer Science"
, volume =	"10"
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, West Germany"
, year =	1987
, keywords =	"design of algorithms, discrete geometry, book"
, update =	"93.09 erickson"
}

@article{FBF77
, author =	"J. H. Friedman and J. L. Bentley and R. A. Finkel"
, title =	"An algorithm for finding best matches in logarithmic
		expected time"
, journal =	"ACM Transactions on Mathematical Software"
, year =	1977
, volume =	"3"
, number =	"3"
, pages =	"209--226"
}

@inproceedings{GaR93
, author =	"I. Galperin and R. L. Rivest"
, title =	"Scapegoat trees"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"165--174"
}

@inproceedings{GRS93
, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
, title =	"Randomized Data Structures for the Dynamic
		Closest-Pair Problem"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"301--310"
, update =	"93.05 smid"
}

@inproceedings{Kle97
, author =	"J. Kleinberg"
, title =	"Two Algorithms for Nearest-Neighbor Search in High Dimension"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC 97"
, year =	1997
, pages =	"599--608"
, update =	"97.07 agarwal"
}

@inproceedings{LeS92
, author =	"H.-P. Lenhof and M. Smid"
, title =	"Enumerating the $k$ closest pairs optimally"
, booktitle =	"Proc. 33rd Ann. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"380--386"
}

@inproceedings{MMS94
, author =	"J. S. B. Mitchell and D. M. Mount and S. Suri"
, title =	"Query-sensitive ray shooting"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"359--368"
}

@inproceedings{MNS95
, author =	"D. M. Mount and N. Netanyahu and R. Silverman and A.
		Y. Wu"
, title =	"Chromatic Nearest Neighbor Searching: {A} Query
		Sensitive Approach"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"261--266"
}

@inproceedings{MiV92
, author =	"S. A. Mitchell and S. A. Vavasis"
, title =	"Quality mesh generation in three dimensions"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"212--221"
, succeeds =	"mv-qmgtd-92t"
}

@inproceedings{OhS83
, author =	"Y. Ohsawa and M. Sakauchi"
, title =	"The {BD}-tree: {A} new ${N}$-dimensional data
		structure with highly efficient dynamic
		characteristics"
, booktitle =	"IFIP Conf."
, address =	"Paris"
, year =	1983
, pages =	"539--544"
}

@book{Ope93
, author =	"OpenGL Architecture Review Board"
, title =	"OpenGL Programming Guide"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1993
}

@inproceedings{Ove96
, author =      "M. H. Overmars"
, title =       "Designing the Computational Geometry Algorithms Library CGAL"
, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
, site =        "Philadelphia, PA, USA"
, month =       may
, year =        1996
, pages =       "113--119"
, update =      "97.11 held"
}

@book{PrS85
, author =	"F. P. Preparata and M. I. Shamos"
, title =	"Computational Geometry: An Introduction"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1985
, keywords =	"book"
, oldlabel =	"geom-727"
}

@inproceedings{Riv74
, author =	"R. L. Rivest"
, title =	"{On the optimality of Elias's algorithm for performing
		best-match searches}"
, booktitle =	"Information Processing"
, year =	1974
, publisher =	"North Holland Publishing Company"
, pages =	"678--681"
}

@article{Sal89
, author =	"J. Salowe"
, title =	"{$L_{\infty}$} interdistance selection by parametric
		search"
, journal =	"Inform. Process. Lett."
, volume =	"30"
, year =	1989
, pages =	"9--14"
, oldlabel =	"geom-2539"
}

@inproceedings{Sal91
, author =	"J. S. Salowe"
, title =	"Shallow interdistance selection and interdistance
		enumeration"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes in Computer Science"
, volume =	"519"
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"117--128"
, keywords =	"proximity, distance"
, oldlabel =	"geom-2615"
}

@article{Sal92
, author =	"J. S. Salowe"
, title =	"Enumerating interdistances in space"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"2"
, year =	1992
, pages =	"49--59"
, keywords =	"distance, fixed-radius near neighbors, parametric
		search, selec tion"
}

@book{Sam90
, author =	"H. Samet"
, title =	"The Design and Analysis of Spatial Data Structures"
, publisher =	"Addison Wesley"
, address =	"Reading, MA"
, year =	1990
}

@article{SlT83
, author =	"D. D. Sleator and R.  E. Tarjan"
, title =	"A data structure for dynamic trees"
, journal =	"J. Comput. Syst. Sci."
, year =	1983
, volume =	"26"
, pages =	"362--391"
}

@article{SoM87
, author =	"M. R. Soleymani and S. D. Morgera"
, title =	"An efficient nearest neighbor search method"
, journal =	"IEEE Transactions on Communications"
, year =	1987
, volume =	"35"
, number =	"6"
, pages =	"677--679"
}

@article{Spr91
, author =	"R. L. Sproull"
, title =	"Refinements to nearest-neighbor searching"
, journal =	"Algorithmica"
, year =	1991
, volume =	"6"
, pages =	"579--589"
}

@article{SSS92
, author =	"C. Schwarz and M. Smid and J. Snoeyink"
, title =	"An optimal algorithm for the on-line closest-pair problem"
, journal =	"Algorithmica"
, volume =	"12"
, year =	1994
, pages =	"18--29"
}

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

@article{Vai89
, author =	"P. M. Vaidya"
, title =	"An {$O(n \log n)$} algorithm for the
		all-nearest-neighbors problem"
, journal =	"Discrete Comput. Geom."
, volume =	"4"
, year =	1989
, pages =	"101--115"
, oldlabel =	"geom-1733.2"
, succeeds =	"v-oannp-86"
}

@article{Wil64
, author =	"J. W. J. Williams"
, title =	"Algorithm 232 (heapsort)"
, journal =	"Communications of the ACM"
, volume =	"7"
, year =	1964
, pages =	"347--348"
}

@inproceedings{YaY85
, author =	"A. C. Yao and F. F. Yao"
, title =	"A general approach to $d$-dimensional geometric
		queries"
, booktitle =	"Proc. 17th Ann. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"163--168"
}

