utility's blog

By utility, history, 6 months ago, In English,

We have 2 sets — S and T in 3d space ( points from these sets are separed by hyperplane ).

We need to find closest pair of points ( one of which is from S, other one from T ).

There's an algorithm for 2d case when we have only 1 set of points. How do this solve this one though?