I have a 2D area with ‘dots’ distributed on this area. I now am trying to detect ‘clusters’ of dots, that is, areas with a certain high density of dots.
Any thoughts on (or links to articles with thoughts on) how to elegantly detect these areas?
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.
How about defining an arbitrary resolution for your space, and calculate for each point in that matrix, a measure of the distance from that point to all dots, then you could make a ‘heat graph’ and use a threshold to define the clusters.
It’s a nice exercise for processing, maybe later I will post a solution.
EDIT:
Here it is:
EDIT 2 (slighly less inefficient code but same output):
And the output with (a reduced) Kent sample: