seed = iter.next(); for(int i = 0, j = 1; iter.hasNext(); j++, i++) { double dist = quadraticEuclidean(seed, iter.next()); if(dist <= 0.) { // Duplicate. sortd[i] = quadraticEuclidean(center, points.get(sorti[i]));
Vector p = iter.next(); sort[i] = new DoubleIntPair(quadraticEuclidean(seed, p), i + 1); sort[i].first = quadraticEuclidean(center, points.get(sort[i].second));
seed = iter.next(); for(int i = 0, j = 1; iter.hasNext(); j++, i++) { double dist = quadraticEuclidean(seed, iter.next()); if(dist <= 0.) { // Duplicate. sortd[i] = quadraticEuclidean(center, points.get(sorti[i]));