trees/thirdGenKD/SquareEuclideanDistanceFunction.java

package ags.utils.dataStructures.trees.thirdGenKD;

/**
 *
 */
public class SquareEuclideanDistanceFunction implements DistanceFunction {
    @Override
    public double distance(double[] p1, double[] p2) {
        double d = 0;

        for (int i = 0; i < p1.length; i++) {
            double diff = (p1[i] - p2[i]);
            d += diff * diff;
        }

        return d;
    }

    @Override
    public double distanceToRect(double[] point, double[] min, double[] max) {
        double d = 0;

        for (int i = 0; i < point.length; i++) {
            double diff = 0;
            if (point[i] > max[i]) {
                diff = (point[i] - max[i]);
            }
            else if (point[i] < min[i]) {
                diff = (point[i] - min[i]);
            }
            d += diff * diff;
        }

        return d;
    }
}
1	torben	2744	package ags.utils.dataStructures.trees.thirdGenKD;
2
3			/**
4			*
5			*/
6			public class SquareEuclideanDistanceFunction implements DistanceFunction {
7			@Override
8			public double distance(double[] p1, double[] p2) {
9			double d = 0;
10
11			for (int i = 0; i < p1.length; i++) {
12			double diff = (p1[i] - p2[i]);
13			d += diff * diff;
14			}
15
16			return d;
17			}
18
19			@Override
20			public double distanceToRect(double[] point, double[] min, double[] max) {
21			double d = 0;
22
23			for (int i = 0; i < point.length; i++) {
24			double diff = 0;
25			if (point[i] > max[i]) {
26			diff = (point[i] - max[i]);
27			}
28			else if (point[i] < min[i]) {
29			diff = (point[i] - min[i]);
30			}
31			d += diff * diff;
32			}
33
34			return d;
35			}
36			}