I'd like a test to determine whether a number of collected 2D points (say, x,y in (0,1]) are distributed uniformly across the space. The points will be one or more 'paths' through the space - collections of points resembling movement through the 2D space. I want to determine, for the entire area, whether the entire set of points within all paths looks uniformly distributed across that area or if the points have some degree of proximity (e.g., if most paths stay in one corner of the graph).
I've considered these:
- Simple regression, but I don't expect to know how the points are distributed if they aren't uniform (polynomial doesn't seem to be a good fit)
- Taking discrete chunks of the space and computing the sum of square error between the expected density and the observed density, or using a Chi-squared on the segments.
- Some sort of clustering algorithm/test - not sure what I'd use here, but again, I'm not sure clusters are what I'm looking for
Any other suggestions/ideas?