Hello
Could anyone point me in the direction of code/algorithms/papers on forcing clumped 2D data into the best uniformly distributed grid.
For instance I have 4,096 data-points which each contain an x value and a y value. There may be duplicate data-points, and the values will not necessarily be restricted to a maximum of 64. I want to allocate the data-points to a 64 * 64 grid, with each data-point mapping to one grid point, so the 64 by 64 grid is filled.
I presume this is not an unusual field and that it is mostly a terminology problem, however I have been unsuccessful searching for many terms including forcing/mapping uniform/even distribution/dispersion nearest neighbour.
Thanks