Hello all,
I have a question concerning the "scattering of coordinates". I don't know if this
combination is sematically correct, but I hope you know what I mean.
Imagine you have a table with points. Each recordset has an ID, but alot of have same
x and y coordinates.
I would like to scatter these points, so that in the end each recordset has unique
coordinates and is visible in the map.
I'm sure that the resulting coordinates doesn't represent the reality, but thats not a
problem.
Thats the way I would like to do it.
Investigate a factor for the x- and y-coordinate for each recordset.
Multiply this factor with the width for Scattering (maybe 50 metres ) and with the
original coordinates to get a new, unique pair of coordinates.
The Investigation of the factor should be done by a "scatterscreen" which also
represent the resulting position of the data.
The first recordset position (0) gets the original Coordinate, which lies in the
middle of the resulting cluster.
The first round produces 1*8 new Coordinates, the second round produces 2*8 new
Coordinates and so on.....
2 2 2 2 2
2 1 1 1 2
2 1 0 1 2
2 1 1 1 2
2 2 2 2 2
Imagine the x and y axis go through the first point (0,0) which represent the middle
of the cluster.
Factors for -lowest row: -1/-1; 0/-1; 1/-1; middle row: -1/0; 1/0; highest row -1/1;
0;1; 1/1.
Point 0/0 could not be used again, because its already represented by the origin.
My problem is to write a algorithm which considers that only the shown combinations
could be used for the factors.
That means, In the second round the factor -1/-1 could not be used because it is used
in the first rouen and would cause coordinate-duplicates.
Puuh.
Sorry that I did need so many word to describe a small problem, but I hope I did it in
an understandable way.
Any suggestions would be helpful.
Thanks in Advance
Hendrik Possberg
