1. Berchtold, S., Keim, D.A., Kriegel, H.P., Seidl, T.: Indexing the solution space: a new technique for nearest neighbor search in high-dimensional space. IEEE Trans. Knowl. Data Eng. 12(1), 45–57 (2000)
2. Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications Chap. 7. Berlin, Heidelberg, New York: Springer (1996)
3. Cheung, K.L., Fu, W.-C.: Enhanced nearest neighbour search on the r-tree. SIGMOD Rec. 27(3), 16–21 (1998)
4. Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., Abbadi, A.E.: Approximate nearest neighbor searching in multimedia databases. In: Proc. 17th IEEE Int. Conf. on Data Eng. (ICDE’01) (2001)
5. Goldstein, J., Ramakrishnan, R.: Contrast plots and p-sphere trees: Space vs. time in nearest neighbor searches. In: Proc. 26th Int. Conf. on Very Large Data Bases (VLDB’00), pp. 429–440, Cairo, Egypt (2000)