Methods
Finds a certain amour of points in a list of single-precision 2D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a "short list".
public static IEnumerable<int[]> Point2dKNeighbors()
hayPoints,
A point cloud to be searched.
needlePoints,
Points to search for.
amount
The required amount of closest neighbors to find.
Returns: An enumerable of arrays of indices; each array contains the indices for each of the needlePts.
Finds a certain amour of points in a list of single-precision 2D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a "short list".
public static IEnumerable<int[]> Point2fKNeighbors()
hayPoints,
A point cloud to be searched.
needlePoints,
Points to search for.
amount
The required amount of closest neighbors to find.
Returns: An enumerable of arrays of indices; each array contains the indices for each of the needlePts.
Finds a certain amour of points in a list of 3D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a "short list". See RTree KNeighbors for alternatives.
public static IEnumerable<int[]> Point3dKNeighbors()
hayPoints,
A point cloud to be searched.
needlePoints,
Points to search for.
amount
The required amount of closest neighbors to find.
Returns: An enumerable of arrays of indices; each array contains the indices for each of the needlePts.
Finds a certain amour of points in a list of single-precision 3D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a "short list".
public static IEnumerable<int[]> Point3fKNeighbors()
hayPoints,
A point cloud to be searched.
needlePoints,
Points to search for.
amount
The required amount of closest neighbors to find.
Returns: An enumerable of arrays of indices; each array contains the indices for each of the needlePts.
Finds a certain amount of points in a list of 3D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a short list.
public static IEnumerable<int[]> PointCloudKNeighbors()
pointcloud,
A point cloud to be searched.
needlePoints,
Points to search for.
amount
The required amount of closest neighbors to find.
Returns: An enumerable of arrays of indices; each array contains the indices for each of the needlePts.