Parent Finding [Morrison 02, 03]

 	
lay out a root(n) subset with [Chalmers 96]
for all remaining points
find "parent": laid-out point closest in high D
place point close to this parent
O(n^5/4) algorithm



Issues

which distance metric: Euclidean or other? 

computation
naive: O(n^3)
better: O(n^2) Chalmers 96
hybrid: O(n sqrt(n))


16