Faster Spring Model [Chalmers 96]
		• compare distances only with a few points – maintain small local neighborhood set – each time pick some randoms, swap in if closer • small constant: 6 locals, 3 randoms typical – O(n) iteration, O(n2) algorithm