lsm/PdfPig
1
0
Fork 0
mirror of https://github.com/UglyToad/PdfPig.git synced 2025-04-05 20:55:01 +08:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

Improve KdTree creation performance

Browse Source
This commit is contained in:
BobLd 2024-06-26 16:27:12 +01:00
parent b05dfac672
commit bac00e475b
1 changed files with 42 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -89,16 +89,56 @@
array[i] = new KdTreeElement<T>(i, elementsPointFunc(el), el);
}
#if NET6_0_OR_GREATER
Root = BuildTree(new Span<KdTreeElement<T>>(array));
#else
Root = BuildTree(new ArraySegment<KdTreeElement<T>>(array));
#endif
}
#if NET6_0_OR_GREATER
private KdTreeNode<T> BuildTree(Span<KdTreeElement<T>> P, int depth = 0)
{
if (P.Length == 0)
{
return null;
}
if (P.Length == 1)
{
return new KdTreeLeaf<T>(P[0], depth);
}
if (depth % 2 == 0)
{
P.Sort(kdTreeComparerX);
}
else
{
P.Sort(kdTreeComparerY);
}
if (P.Length == 2)
{
return new KdTreeNode<T>(new KdTreeLeaf<T>(P[0], depth + 1), null, P[1], depth);
}
int median = P.Length / 2;
KdTreeNode<T> vLeft = BuildTree(P.Slice(0, median), depth + 1);
KdTreeNode<T> vRight = BuildTree(P.Slice(median + 1), depth + 1);
return new KdTreeNode<T>(vLeft, vRight, P[median], depth);
}
#else
private KdTreeNode<T> BuildTree(ArraySegment<KdTreeElement<T>> P, int depth = 0)
{
if (P.Count == 0)
{
return null;
}
else if (P.Count == 1)
if (P.Count == 1)
{
return new KdTreeLeaf<T>(P.GetAt(0), depth);
}
@ -124,6 +164,7 @@
return new KdTreeNode<T>(vLeft, vRight, P.GetAt(median), depth);
}
#endif
#region NN
/// <summary>