|
1969
|
R-trees: A Dynamic Index Structure for Spatial Searching
– Antonin Guttman
- 1984
|
|
80
|
Optimal expected-time algorithms for closest point problems
– J Bentley, B Weide, A Yao
- 1980
|
|
290
|
A sweepline algorithm for voronoi diagrams
– S Fortune
- 1987
|
|
357
|
Applications of Random Sampling in Computational Geometry, II
– Kenneth L. Clarkson, Peter W. Shor
- 1995
|
|
1084
|
The Design and Analysis of Spatial Data Structures
– H Samet
- 1990
|
|
1789
|
Robot Motion Planning
– J-C Latombe
- 1991
|
|
362
|
The grid file: An adaptable, symmetric multikey file structure
– J. Nievergelt, H. Hinterberger, K. C. Sevcik
- 1984
|
|
911
|
Multidimensional binary search trees used for associative searching
– J L Bentley
- 1975
|
|
1611
|
Computational geometry: An introduction
– F P Preparata, M I Shamos
- 1985
|
|
643
|
Algorithms in Combinatorial Geometry
– Herbert Edelsbrunner
- 1987
|
|
50
|
Spatial search with polyhedra
– H V Jagadish
- 1990
|
|
55
|
Operations on images using quad trees
– G M Hunter, K Steiglitz
- 1979
|
|
121
|
A retrieval technique for similar shape
– H V Jagadish
- 1991
|
|
2107
|
Introduction to statistical pattern recognition
– K Fukunaga
- 1990
|
|
855
|
The R*-tree: an efficient and robust access method for points and rectangles
– Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger
- 1990
|
|
2699
|
MJ: Introduction to Modern Information Retrieval
– G Salton, McGill
- 1986
|
|
172
|
Provably Good Mesh Generation
– Marshall Bern, David Eppstein, John Gilbert
- 1990
|
|
275
|
Computational Geometry: An Introduction Through Randomized Algorithms
– K Mulmuley
- 1993
|
|
225
|
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
– Peter N. Yianilos
- 1993
|
