KDT Closest Edges¶
Alias: KDTree Edges
On each update it takes an incoming pool of Vertices and places them in a K-dimensional Tree. It will return the Edges it can make between those vertices pairs that satisfy the constraints imposed by the 4 parameters.
- Verts, a pool of vertices to iterate through
|mindist||float||Minimum Distance to accept a pair|
|maxdist||float||Maximum Distance to accept a pair|
|maxNum||int||Max number of edges to associate with the incoming vertex|
|Skip||int||Skip first n found matches if possible|
- Edges, which can connect the pool of incoming Verts to eachother.