Created by: vicdoval
KDT Closest Path Node:
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.
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.
Find a coherent short path among shuffled vertices.
Also moved all the KDT functions (Closest Edges and Closest Points) to sverchok.utils.sv_KDT_utils
-
Code changes complete. -
Code documentation complete. -
Documentation for users complete (or not required, if user never sees these changes). -
Manual testing done. -
Unit-tests implemented. -
Ready for merge.