A. References, P. Andoni, and . Indyk, Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, Communications of the ACM, vol.51, issue.1, pp.117-122, 2008.

J. Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, vol.18, issue.9, pp.509-517, 1975.
DOI : 10.1145/361002.361007

J. Bentley and J. Friedman, Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces, IEEE Transactions on Computers, vol.27, issue.2, pp.97-105, 1978.
DOI : 10.1109/TC.1978.1675043

T. Bozkaya and M. Ozsoyoglu, Distance-based indexing for high-dimensional metric spaces, Proceedings of the 1997 ACM SIGMOD international conference on Management of Data, pp.357-368, 1997.

M. Carreira-perpiñán and R. Zemel, Proximity graphs for clustering and manifold learning, Advances in Neural Information Processing Systems, pp.225-232, 2005.

E. Chavez and G. Navarro, An effective clustering algorithm to index high dimensional metric spaces, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, p.75, 2000.
DOI : 10.1109/SPIRE.2000.878182

E. Chávez and G. Navarro, A compact space decomposition for effective metric indexing, Pattern Recognition Letters, vol.26, issue.9, pp.1363-1376, 2005.
DOI : 10.1016/j.patrec.2004.11.014

. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann type complexity, Journal of the ACM, vol.47, issue.6, pp.1028-1047, 2000.
DOI : 10.1145/355541.355562
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.2318

P. Ciaccia and M. Patella, Bulk loading the m-tree, Proceedings of the 9th Australasian Database Conference, pp.15-26, 1998.

T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, McGraw- Hill Science / Engineering / Math, 2003.

T. Cour, F. Benezit, and J. Shi, Spectral Segmentation with Multiscale Graph Decomposition, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), pp.1124-1131, 2005.
DOI : 10.1109/CVPR.2005.332
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.1465

M. Dry, D. Navarro, K. Preiss, and M. Lee, The perceptual organization of point constellations, Annual Meeting of the Cognitive Science Society, 2009.

W. Eddy, A. Mockus, and S. Oue, Approximate single linkage cluster analysis of large data sets in high-dimensional spaces, Computational Statistics & Data Analysis, vol.23, issue.1, pp.29-43, 1996.
DOI : 10.1016/S0167-9473(96)00019-9

P. Felzenszwalb and D. Huttenlocher, Efficient Graph-Based Image Segmentation, International Journal of Computer Vision, vol.59, issue.2, pp.167-181, 2004.
DOI : 10.1023/B:VISI.0000022288.19776.77

C. Fowlkes and J. Malik, How much does globalization help segmentation?, 2004.

A. Frank and A. Asuncion, UCI machine learning repository, 2010.

K. Fukunaga, Introduction to Statistical Pattern Recognition, 1999.

R. Graham and P. Hell, On the History of the Minimum Spanning Tree Problem, IEEE Annals of the History of Computing, vol.7, issue.1, pp.43-57, 1985.
DOI : 10.1109/MAHC.1985.10011

A. K. Jain and R. C. Dubes, Algorithms for clustering data, 1988.

D. Karger, P. Klein, and R. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, Journal of the ACM, vol.42, issue.2, pp.321-328, 1995.
DOI : 10.1145/201019.201022

T. Lai, D. Rafa, and . Nelson, Approximate minimum spanning tree clustering in high-dimensional space. Intelligent Data Analysis, pp.575-597, 2009.

K. Leibe, B. Mikolajczyk, and . Schiele, Efficient Clustering and Matching for Object Class Recognition, Procedings of the British Machine Vision Conference 2006, 2006.
DOI : 10.5244/C.20.81

. Lowe, Distinctive Image Features from Scale-Invariant Keypoints, International Journal of Computer Vision, vol.60, issue.2, pp.91-110, 2004.
DOI : 10.1023/B:VISI.0000029664.99615.94

D. Martin, C. Fowlkes, D. Tal, and J. Malik, A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, pp.416-423, 2001.
DOI : 10.1109/ICCV.2001.937655

M. Muja and D. Lowe, Fast approximate nearest neighbors with automatic algorithm configuration, VISAPP International Conference on Computer Vision Theory and Applications, pp.331-340, 2009.

F. Murtagh, A Survey of Recent Advances in Hierarchical Clustering Algorithms, The Computer Journal, vol.26, issue.4, pp.354-359, 1983.
DOI : 10.1093/comjnl/26.4.354

S. Pettie and V. Ramachandran, An optimal minimum spanning tree algorithm, Journal of the ACM, vol.49, issue.1, pp.16-34, 2002.
DOI : 10.1145/505241.505243
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.7670

H. Samet, Depth-first k-nearest neighbor finding using the MaxNearestDist estimator, 12th International Conference on Image Analysis and Processing, 2003.Proceedings., p.486, 2003.
DOI : 10.1109/ICIAP.2003.1234097

C. Silpa-anan and R. Hartley, Optimised KD-trees for fast image descriptor matching, 2008 IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2008.
DOI : 10.1109/CVPR.2008.4587638
URL : http://hdl.handle.net/1885/37143

T. Skopal, J. Pokorn´ypokorn´y, M. Krátk´krátk´y, and V. Sná?el, Revisiting M-Tree Building Principles, Advances in Databases and Information Systems, pp.148-162
DOI : 10.1007/978-3-540-39403-7_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.574.1115

T. Skopal, J. Pokorn´ypokorn´y, and V. Sná?el, Nearest Neighbours Search Using the PM-Tree
DOI : 10.1007/11408079_73