KDT Closest Path¶
Generator-> Plane
Transform-> Noise Displace
Number-> A Number
Text-> Stethoscope
Functionality¶
Using a K-dimensional Tree it will create a path starting at the desired index joining each vertex to the closest free vertex. If no vertex is found in the desired range the path will break and will start a new path at the next unused vertex.
Inputs / Parameter¶
Name |
Type |
Description |
|---|---|---|
Verts |
Vectors |
Vertices to make path |
Max Distance |
float |
Maximum Distance to accept a pair |
Start Index |
Int |
Vert index where path will start |
Cyclic |
Boolean |
Enable to join the first and last vertices |
Advanced Parameters¶
In the N-Panel (and on the right-click menu) you can find:
Match List Global: Define how list with different lengths should be matched. Refers to the matching of groups
Match List Local: Define how list with different lengths should be matched. Refers to the matching of max distances and vertices
Outputs¶
Edges, which can connect the pool of incoming Vertices to make a path.
Examples¶
Creating paths in a random vector field.
Generator-> Random Vector
Vector-> Vector Rewire
Viz-> Viewer Draw
Find the best starting index to make the minimum path by starting at every vertex and comparing the path lengths and taking the shortest one.
Number-> A Number
EQUAL: Number-> Scalar Math
Number-> Random Num Gen
Number-> Number Range
Vector-> Vector In
Analyzers-> Path Length
List->List Main-> List Join
List->List Struct-> List Item
List->List Struct-> List Levels
List->List Main-> List Math
List-> List Mask (Out)
Viz-> Viewer Draw
Viz-> Viewer Index+
Text-> Stethoscope
Find a coherent short path among shuffled vertices.
Scene-> Objects In Lite
Viz-> Viewer Draw
Viz-> Viewer Index+