[Algorithms] merging of points in 3D space

[Peter S. <sz...@po...>]

Hello all,

I am having the following problem:

Consider an array of points in 3D given by (x, y, z). Every point is in the
array more times (5-6 times, does not really matter) but the problem is that
these points are not really the same - there are small differences between their
coordinates
e.g. points with coordinates

1.000 1.000 1.000
0.999 1.001 1.000
1.000 1.002 0.989 etc

are considered to represent the same point.

Now, my question is, how to 'merge' these points into one (e.g. in the previous
example, keep only one such point) _VERY_ fast. The trivial algorithm is far-far
away (as usual) from the fast enough.

Any help appreciated.



  

-- 
Best regards,
 Peter                          mailto:sz...@po...