1. Aref WG, Samet H (1992) Uniquely reporting spatial objects: yet another operation for comparing spatial data structures. In: Proceedings of the 5th international symposium on spatial data handling, Charleston, pp 178–189
2. Aref WG, Samet H (1994) Hashing by proximity to process duplicates in spatial databases. In: Proceedings of the 3rd international conference on information and knowledge management (CIKM), Gaithersburg, pp 347–354
3. Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J ACM 45(6):891-923
4. Also see proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, Arlington, pp 573-582, Jan 1994
5. Berchtold S, Böhm C, Keim DA, Kriegel H-P (1997) A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS), Tucson, pp 78–86