Closest pair of points 3d

Revision en1, by utility, 2018-02-09 19:52:37

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?

Tags #geometry, divide and conquer

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English utility 2018-02-09 19:52:37 317 Initial revision (published)