Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

pillar sequence searching needs ad-hoc strategy #90

Open
yijiangh opened this issue Jan 14, 2018 · 2 comments
Open

pillar sequence searching needs ad-hoc strategy #90

yijiangh opened this issue Jan 14, 2018 · 2 comments
Labels
enhancement

Comments

@yijiangh
Copy link
Owner

No description provided.

@yijiangh
Copy link
Owner Author

yijiangh commented Jan 14, 2018 •
edited
Loading

  • In GH, use eef's bounding box to determine min radius.

  • 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
Copy link
Owner Author

C++ kdtree library: nanoflann.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@yijiangh