[confproc] Roger Weber / 1998 / A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces / Proc. of the 24th VLDB Conference : 194~205

[confproc] Stefan Berchtold / 1997 / A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space / Proc. of the 16th PODS Conference : 78~86

[confproc] S. Berchtold / 1998 / Fast Nearest Neighbor Search in High-dimensional Space / Proc. of the 14th ICDE Conference : 209~218

[book] M. de Berg / 1997 / Computational Geometry - Algorithms and Applications / Springer : 145~161

[journal] V. Gaede / 1998 / MultidimensionMultidimensional Access Methodsal Access Methods / ACM Computing Surveys 30(2) : 170~231

[confproc] Guttman, A / 1984 / R-trees: A dynamic index structure for spatial searching / Proc. of ACM SIGMOD : 47~57

[confproc] F. Korn / 1996 / Fast Nearest Neighbor Search in Medical Image Databases / Proc. of the 22th VLDB Conference : 215~226

[journal] 김범수 / 1998 / 내용 기반 이미지 검색을 위한 점진적 여과 알고리즘 / 한국정보과학회 논문지 (B) 25(1) : 64~71

[confproc] T. Seidl / 1998 / Optimal Multi-Step k-Nearest Neighbor Search / Proc. of SIGMOD : 154~165

[confproc] Norbert Beckmann / 1990 / The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles / Proc. of ACM SIGMOD : 322~331

[book] James D. Foley / 1990 / Computer Graphics - Principles and Practice / Addision-Wesley Publishing Company, 2nd Ed : 124~127

[web] / R*-tree source / http://www.research.att.com/ ~berchtol/my_software.html

[web] / Qhull Library / http://www.geom.umn.edu/locate/ qhull

[web] / Multi Dimensional Data Sets / http://www.cs.du.edu/ ~leut/MultiDimData.html