public Pair(InputLine cut, InputLine fill)
{
this.Cut = cut;
this.Fill = fill;
double dX = cut.X - fill.X;
double dY = cut.Y - fill.Y;
double dZ = cut.Z - fill.Z;
this.DistanceSquared = ((dX * dX) + (dY * dY) + (dZ * dZ));
}
public IList <InputLine> ReadInputData(string filepath)
{
var reader = new StreamReader(File.OpenRead(filepath));
IList <InputLine> inputData = new List <InputLine>();
string line = reader.ReadLine();
while (!reader.EndOfStream)
{
line = reader.ReadLine();
InputLine temp = new InputLine();
temp.Add(line);
inputData.Add(temp);
}
return(inputData);
}
public Runner(ref IList <InputLine> cuts, ref IList <InputLine> fills)
{
Stopwatch sw = new Stopwatch();
double minDistance = 1e30;
int closestCut = new int();
int closestFill = new int();
sw.Start();
KDTree.KDTree <InputLine> cutTree = new KDTree.KDTree <InputLine>(3);
for (int i = 0; i < cuts.Count(); i++)
{
cutTree.AddPoint(new double[] { cuts[i].X, cuts[i].Y, cuts[i].Z }, cuts[i]);
}
sw.Stop();
Console.WriteLine("Tree Created in {0:0.00} milliseconds", sw.ElapsedMilliseconds);
sw.Reset();
sw.Start();
for (int j = 0; j < fills.Count(); j++)
{
var pIter = cutTree.NearestNeighbors(new double[] { fills[j].X, fills[j].Y, fills[j].Z }, 1);
while (pIter.MoveNext())
{
InputLine pCurrent = pIter.Current;
double currentDistance = new double();
currentDistance = pCurrent.Distance(fills[j]);
if (currentDistance < minDistance)
{
minDistance = currentDistance;
closestCut = pCurrent.PID;
closestFill = fills[j].PID;
}
}
}
//cuts.Remove(new InputLine().Add(string.Format("{0},1,1,1,1",closestCut)));
sw.Stop();
Console.WriteLine("Nearest Neighbor Found in {0:0.00} milliseconds", sw.ElapsedMilliseconds);
Console.WriteLine("Closet Points are {0} units appart", Math.Sqrt(minDistance));
Console.WriteLine("Closet Points Cut:{0}, Fill:{1}", closestCut, closestFill);
}
public void Add(InputLine cut, InputLine fill)
{
Pair item = new Pair(cut, fill);
this._pairings.Add(item);
}
