List/Trees problem; connect polygon vertices to a target point

Hi all,
I have a pretty noob problem with trees/list. So, as I tried to explain in the pic attached, I have n hexagons and m "target" points (note that m is a f(n)); what I'd like to do is to connect the hexagons' vertices [1.1; 2.1; 3.2; 4.2; 4.7; 5.7; 1.6; 6.6] to the target point (in cyano) in a recursive way so that if I change n, the definition can work anyway.
In others words the next target point would interest the hexagons number 2; 3; 8; 7
PS
I thought it would be possible using the closest point component but I believe that using trees/lists would be more efficent.
Thanks a lot.
D.