New answers tagged

2

Sorry I didn't read your question correctly at first (and have deleted my comment) //How about this from G = {g[0],g[1],g[2],....} create the set G[0] = { {g[0]}, {g[1]}, {g[2]},...} for each w_i in W find the element c in G[i] such that c contains a point p where p originally came from G, and p is closest to w_i //we want to group w_i along ...



Top 50 recent answers are included