Monday, May 4, 2009
Map Points Cubic Clustering
Here is yet another clustering application. This is very similar to GeoCubes. It is based on a simple but effective algorithm, where the map extent is divided into "cubes". Given a map point from a set, the associated cube that it lies above is selected and the cube internal count is incremented. After processing all map points, the set of cubes with an internal count greater that one are displayed. Here is the application in action. And like usual, the source code is here.