[SciPy-User] maximally sparse subset of points

[Gustavo Goretkin]

I have a dataset of N points (in 4 dimensions) and I'd like to select a
smaller subset, size M, of those points that are maximally spread out. An
approximation is fine. Other than the K-d tree, is there anything in SciPy
or other Python module to help accomplish this?

Thanks
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.scipy.org/pipermail/scipy-user/attachments/20110727/ee1729a7/attachment.html>