Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have a set of xyz coordinates for points distributed on a arbitrary 3D surface.(about 50000) I need to group these points in to 10 domains each containing approximately 1/10th of data points according to spatial proximity. Basically 10 surface patches on the surface. Thanks.
Looks like you want a clustering algorithm.
I has luck with k-means++ before.
See http://en.wikipedia.org/wiki/K-means_clustering for the k-means algorithm
and http://en.wikipedia.org/wiki/K-means%2B%2B for the k-means++ variants.