[x] In GH, use eef's bounding box to determine min radius.
[x] In GH, Use KdTree to get closest neighbors (e.g. use accord package). Highlight the conflicting nodes and suggest users modify them. (EDIT: a dummy O(n^2) check is performed for now).
[ ] In mpp, use some existing TSP algorithm or package to solve for a near-optimal solution.
yijiangh
commented
6 years ago
[x] In GH, use eef's bounding box to determine min radius.
[x] In GH, Use KdTree to get closest neighbors (e.g. use accord package). Highlight the conflicting nodes and suggest users modify them. (EDIT: a dummy O(n^2) check is performed for now).
[ ] In mpp, use some existing TSP algorithm or package to solve for a near-optimal solution.