lsm/PdfPig
1
0
Fork 0
mirror of https://github.com/UglyToad/PdfPig.git synced 2025-09-19 19:07:56 +08:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

fix kd-tree

Browse Source
This commit is contained in:
BobLd
2020-03-04 10:53:25 +00:00
committed by Eliot Jones
parent 1e1a33d46e
commit c4309ef31e
1 changed files with 18 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
src/UglyToad.PdfPig.DocumentLayoutAnalysis/KdTree.cs
View File

@@ -29,14 +29,21 @@
throw new ArgumentException("KdTree(): candidates cannot be null or empty.", nameof(candidates)); throw new ArgumentException("KdTree(): candidates cannot be null or empty.", nameof(candidates));
} }
Root = BuildTree( Console.WriteLine("New");
Enumerable.Range(0, candidates.Count).Zip(candidates, (e, p) => (e, candidatesPointFunc(p), p)).ToArray(),
candidates.Count, 0); Root = BuildTree(Enumerable.Range(0, candidates.Count).Zip(candidates, (e, p) => (e, candidatesPointFunc(p), p)).ToArray(), 0);
} }
private KdTreeNode<T> BuildTree((int, PdfPoint, T)[] P, int length, int depth) private KdTreeNode<T> BuildTree((int, PdfPoint, T)[] P, int depth)
{ {
int median = length / 2; if (P.Length == 0)
{
return null;
}
else if (P.Length == 1)
{
return new KdTreeLeaf<T>(P[0], depth);
}
if (depth % 2 == 0) if (depth % 2 == 0)
{ {
@@ -47,27 +54,15 @@
Array.Sort(P, (p0, p1) => p0.Item2.Y.CompareTo(p1.Item2.Y)); Array.Sort(P, (p0, p1) => p0.Item2.Y.CompareTo(p1.Item2.Y));
} }
// left side if (P.Length == 2)
KdTreeNode<T> vLeft = null;
if (median == 1)
{ {
vLeft = new KdTreeLeaf<T>(P[0], depth); return new KdTreeNode<T>(new KdTreeLeaf<T>(P[0], depth), null, P[1], depth);
}
else if (median > 1)
{
vLeft = BuildTree(P.Take(median).ToArray(), median, depth + 1);
} }
// right side int median = P.Length / 2;
KdTreeNode<T> vRight = null;
if (median + 2 == length) KdTreeNode<T> vLeft = BuildTree(P.Take(median).ToArray(), depth + 1);
{ KdTreeNode<T> vRight = BuildTree(P.Skip(median + 1).ToArray(), depth + 1);
vRight = new KdTreeLeaf<T>(P[median + 1], depth);
}
else if (median + 2 < length)
{
vRight = BuildTree(P.Skip(median + 1).ToArray(), length - median - 1, depth + 1);
}
return new KdTreeNode<T>(vLeft, vRight, P[median], depth); return new KdTreeNode<T>(vLeft, vRight, P[median], depth);
} }