Prototype implementation of a variation of Rabin's algorithm for closest pairs of points;
the implemented algorithm computes distances of two multi-points.
Run-time analysis not formally done, but the running time should be O((N+M)log(N+M)) expected,
where N and M are the sizes of the two multi-points.
Should be able to improve it to O(N+M) expected by using hashing.