-
Notifications
You must be signed in to change notification settings - Fork 2
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.
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
Account graphs routes for minefields and their exclusions #56
Comments
To implement it you need to find out for specific direct line routes May be other approach exists smth with abusing too many points placement, but it will be performance not efficient |
basically question to answer since we operate with graphs, it will be fine to treat minefield first as it has no exclusions i think. Dijkstra graph resolver will be able to switch to prefer exclusion path on its own. We just need to break direct path flight correctly by finding out it is part of a minefield |
May be it is actually possible to do very fast Then the problem level is minimized only to a question, how for specific point to be checked if it is inside a minefield. which looks already rather managable to do |
We can optimize algorithm further, with not using it in systems not having minefields. Also u will need to connect Nodes/Points related to intersection with minefield only with exclusion paths may be. Also u could account Solar objects into minefield too |
That will affect heavily how routes are built through kepler at least.
To deliver some cardamine from Omicron Alpha to ontario Cochrane Depot for example
Supposedly minefields become quite popular
have minefield as a slow down zone
and exclusion paths are invisible trade lanes allowing go cruise speed basically
The text was updated successfully, but these errors were encountered: