KDT Closest Edges

Alias: KDTree Edges

Functionality

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.

Inputs

• Verts, a pool of vertices to iterate through

Parameters

Parameter	Type	Description
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

Fast Mode

This mode requires Scipy dependency. It can be from 3 to 10 times faster but lacks of ‘maxNum’ and ‘Skip’ properties

• Generator-> Plane

• Transform-> Randomize

• Matrix-> Matrix In

• Viz-> Viewer Draw

---

• Generator-> Plane

• Generator-> Circle

• Transform-> Move

• Transform-> Randomize

• Number-> A Number

• Number-> Scalar Math

• Matrix-> Matrix In

• Viz-> Viewer Draw

---

Max Queries Mode

This mode requires Scipy dependency. In this mode the maxNum property is used to determine how many points will be verified so it will produce less connections that the complete mode

• Generator-> Plane

• Transform-> Randomize

• Matrix-> Matrix In

• Viz-> Viewer Draw

---

No Skip Mode

This mode requires Scipy dependency. This is similar to the existing mode but the way the maximum connections is coded produces different results sorting the filter by minimum vertex index

• Generator-> Plane

• Transform-> Randomize

• Matrix-> Matrix In

• Viz-> Viewer Draw

Outputs

• Edges, which can connect the pool of incoming Verts to each other.