This demo illustrates the Euclidean minimum k-insertion tree of random points. Theory behind such a trees is described in INRIA Research Report 7179. (The theory applies for any finite dimension d.) You should (i) insert some random points; (ii) choose α; and finally (ii) see how the length of the tree approaches the theoretical value for k = n. You also can reset any data and restart from the beginning.

This demo is implemented in javascript and is not fully robust nor optimized. The main goal is better depiction. On Mac, safari seems to perform better than Google Chrome, which seems to perform better than Firefox.