I have a around 100k points on the screen (that might update). 2D points.
The goal is to cluster them into groups, by a constant distance. Meaning, finding groups of points that the distance between them is less than this distance. Instead of drawing those points, a big point will be drawn there with a number on it.
The problem is the calculation time.
Tried many algorithms on CPU, but didn’t get the performances i wished for.
I’m trying to find an algorithm to solve this problem in the GPU using WebGL-GLSL, when texture contains all my locations.
Can be single draw phase or multiple.. as long as i achieve better calculation time than i get with the CPU.
