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

return grouped elements i/o grouped indexes in Clustering.NearestNeighbours

Browse Source
This commit is contained in:
BobLd
2020-05-23 19:02:11 +01:00
committed by Eliot Jones
parent 78d57ad5f9
commit 404d6621de
1 changed files with 21 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
src/UglyToad.PdfPig.DocumentLayoutAnalysis/Clustering.cs
View File

@@ -26,7 +26,7 @@
/// <param name="maxDegreeOfParallelism">Sets the maximum number of concurrent tasks enabled.
/// <para>A positive property value limits the number of concurrent operations to the set value.
/// If it is -1, there is no limit on the number of concurrently running operations.</para></param>
public static IEnumerable<HashSet<int>> NearestNeighbours<T>(IReadOnlyList<T> elements,
public static IEnumerable<IReadOnlyList<T>> NearestNeighbours<T>(IReadOnlyList<T> elements,
Func<PdfPoint, PdfPoint, double> distMeasure,
Func<T, T, double> maxDistanceFunction,
Func<T, PdfPoint> pivotPoint, Func<T, PdfPoint> candidatesPoint,
@@ -64,18 +64,18 @@
{
var paired = kdTree.FindNearestNeighbour(pivot, pivotPoint, distMeasure, out int index, out double dist);
if (index != -1)
if (index != -1 && filterFinal(pivot, paired) && dist < maxDistanceFunction(pivot, paired))
{
if (filterFinal(pivot, paired) && dist < maxDistanceFunction(pivot, paired))
{
indexes[e] = index;
}
indexes[e] = index;
}
}
});
// 2. Group indexes
return GroupIndexes(indexes);
foreach (var group in GroupIndexes(indexes))
{
yield return group.Select(i => elements[i]).ToList();
}
}
/// <summary>
@@ -94,7 +94,7 @@
/// <param name="maxDegreeOfParallelism">Sets the maximum number of concurrent tasks enabled.
/// <para>A positive property value limits the number of concurrent operations to the set value.
/// If it is -1, there is no limit on the number of concurrently running operations.</para></param>
public static IEnumerable<HashSet<int>> NearestNeighbours<T>(IReadOnlyList<T> elements, int k,
public static IEnumerable<IReadOnlyList<T>> NearestNeighbours<T>(IReadOnlyList<T> elements, int k,
Func<PdfPoint, PdfPoint, double> distMeasure,
Func<T, T, double> maxDistanceFunction,
Func<T, PdfPoint> pivotPoint, Func<T, PdfPoint> candidatesPoint,
@@ -130,9 +130,7 @@
if (filterPivot(pivot))
{
var paired = kdTree.FindNearestNeighbours(pivot, k, pivotPoint, distMeasure);
foreach (var c in paired)
foreach (var c in kdTree.FindNearestNeighbours(pivot, k, pivotPoint, distMeasure))
{
if (filterFinal(pivot, c.Item1) && c.Item3 < maxDistanceFunction(pivot, c.Item1))
{
@@ -144,7 +142,10 @@
});
// 2. Group indexes
return GroupIndexes(indexes);
foreach (var group in GroupIndexes(indexes))
{
yield return group.Select(i => elements[i]).ToList();
}
}
/// <summary>
@@ -161,7 +162,7 @@
/// <param name="maxDegreeOfParallelism">Sets the maximum number of concurrent tasks enabled.
/// <para>A positive property value limits the number of concurrent operations to the set value.
/// If it is -1, there is no limit on the number of concurrently running operations.</para></param>
public static IEnumerable<HashSet<int>> NearestNeighbours<T>(IReadOnlyList<T> elements,
public static IEnumerable<IReadOnlyList<T>> NearestNeighbours<T>(IReadOnlyList<T> elements,
Func<PdfLine, PdfLine, double> distMeasure,
Func<T, T, double> maxDistanceFunction,
Func<T, PdfLine> pivotLine, Func<T, PdfLine> candidatesLine,
@@ -210,7 +211,10 @@
});
// 2. Group indexes
return GroupIndexes(indexes);
foreach (var group in GroupIndexes(indexes))
{
yield return group.Select(i => elements[i]).ToList();
}
}
/// <summary>
@@ -218,7 +222,7 @@
/// <para>https://en.wikipedia.org/wiki/Depth-first_search</para>
/// </summary>
/// <param name="edges">The graph. edges[i] = j indicates that there is an edge between i and j.</param>
/// <returns>A List of HashSets containing containing the grouped indexes.</returns>
/// <returns>A List of HashSets containing the grouped indexes.</returns>
internal static List<HashSet<int>> GroupIndexes(int[] edges)
{
int[][] adjacency = new int[edges.Length][];
@@ -249,7 +253,7 @@
/// <para>https://en.wikipedia.org/wiki/Depth-first_search</para>
/// </summary>
/// <param name="edges">The graph. edges[i] = [j, k, l, ...] indicates that there is an edge between i and each element j, k, l, ...</param>
/// <returns>A List of HashSets containing containing the grouped indexes.</returns>
/// <returns>A List of HashSets containing the grouped indexes.</returns>
internal static List<HashSet<int>> GroupIndexes(int[][] edges)
{
int[][] adjacency = new int[edges.Length][];
@@ -292,7 +296,7 @@
Stack<int> S = new Stack<int>();
S.Push(s);
while (S.Any())
while (S.Count > 0)
{
var u = S.Pop();
if (!isDone[u])