[. P. Klein-d and R. Tarjan, A randomized lineartime algorithm to find Minimum Spanning Trees, Journal of the Association for Computing Machinery (ACM), vol.42, issue.2, pp.321-328, 1995.

[. 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

[. R. Rivest-t, Introduction to algorithms, 1994.

[. S. Pei and C. Lin, Normalisation of rotationally symmetric shapes for pattern recognition, Pattern Recognition, pp.913-920, 1992.

. Ste and . J. Steele, Growth Rates of Euclidean Minimal Spanning Trees with Power Weighted Edges, The Annals of Probability, vol.16, issue.4, pp.1767-1787, 1988.
DOI : 10.1214/aop/1176991596

. Teague-m, Image analysis via the general theory of moments*, Journal of the Optical Society of America, vol.70, issue.8, pp.920-930, 1980.
DOI : 10.1364/JOSA.70.000920