edu.gwu.algtest
Interface ClosestPairAlgorithm

All Superinterfaces:

edu.gwu.algtest.Algorithm

public interface ClosestPairAlgorithm

extends edu.gwu.algtest.Algorithm

Interface ClosestPairAlgorithm is implemented by algorithms that solve the closest-pair geometric problem. In this problem, you are given a set of 2D points (points on the plane). The objective is to find the two points whose distance (between them) is the least. Note that the points are given as instances of Pointd, a class in the package edu.gwu.geometry. Accordingly, this package needs to be imported by any class implementing this interface.

See Also:

Algorithm

Method Summary
double	findClosestPairDistance(edu.gwu.geometry.Pointd[] points)           Method findClosestPairDistance is given an an array of points and should return the distance between the two closest points amongst the points.

 

Methods inherited from interface edu.gwu.algtest.Algorithm

getName, setPropertyExtractor

 

Method Detail

findClosestPairDistance

public double findClosestPairDistance(edu.gwu.geometry.Pointd[] points)

Method findClosestPairDistance is given an an array of points and should return the distance between the two closest points amongst the points.

Parameters:

points - a Pointd[] value

Returns:

a double value