{"action":"closed","issue":{"url":"https://api.github.com/repos/Luzifer/ed-fast-travel/issues/3","repository_url":"https://api.github.com/repos/Luzifer/ed-fast-travel","labels_url":"https://api.github.com/repos/Luzifer/ed-fast-travel/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/Luzifer/ed-fast-travel/issues/3/comments","events_url":"https://api.github.com/repos/Luzifer/ed-fast-travel/issues/3/events","html_url":"https://github.com/Luzifer/ed-fast-travel/issues/3","id":176935205,"number":3,"title":"Use a better database / data structure to find waypoints","user":{"login":"Luzifer","id":20142,"avatar_url":"https://avatars.githubusercontent.com/u/20142?v=3","gravatar_id":"","url":"https://api.github.com/users/Luzifer","html_url":"https://github.com/Luzifer","followers_url":"https://api.github.com/users/Luzifer/followers","following_url":"https://api.github.com/users/Luzifer/following{/other_user}","gists_url":"https://api.github.com/users/Luzifer/gists{/gist_id}","starred_url":"https://api.github.com/users/Luzifer/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Luzifer/subscriptions","organizations_url":"https://api.github.com/users/Luzifer/orgs","repos_url":"https://api.github.com/users/Luzifer/repos","events_url":"https://api.github.com/users/Luzifer/events{/privacy}","received_events_url":"https://api.github.com/users/Luzifer/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/Luzifer/ed-fast-travel/labels/enhancement","name":"enhancement","color":"84b6eb"},{"url":"https://api.github.com/repos/Luzifer/ed-fast-travel/labels/in%20progress","name":"in progress","color":"ededed"}],"state":"closed","locked":false,"assignee":{"login":"Luzifer","id":20142,"avatar_url":"https://avatars.githubusercontent.com/u/20142?v=3","gravatar_id":"","url":"https://api.github.com/users/Luzifer","html_url":"https://github.com/Luzifer","followers_url":"https://api.github.com/users/Luzifer/followers","following_url":"https://api.github.com/users/Luzifer/following{/other_user}","gists_url":"https://api.github.com/users/Luzifer/gists{/gist_id}","starred_url":"https://api.github.com/users/Luzifer/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Luzifer/subscriptions","organizations_url":"https://api.github.com/users/Luzifer/orgs","repos_url":"https://api.github.com/users/Luzifer/repos","events_url":"https://api.github.com/users/Luzifer/events{/privacy}","received_events_url":"https://api.github.com/users/Luzifer/received_events","type":"User","site_admin":false},"assignees":[{"login":"Luzifer","id":20142,"avatar_url":"https://avatars.githubusercontent.com/u/20142?v=3","gravatar_id":"","url":"https://api.github.com/users/Luzifer","html_url":"https://github.com/Luzifer","followers_url":"https://api.github.com/users/Luzifer/followers","following_url":"https://api.github.com/users/Luzifer/following{/other_user}","gists_url":"https://api.github.com/users/Luzifer/gists{/gist_id}","starred_url":"https://api.github.com/users/Luzifer/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Luzifer/subscriptions","organizations_url":"https://api.github.com/users/Luzifer/orgs","repos_url":"https://api.github.com/users/Luzifer/repos","events_url":"https://api.github.com/users/Luzifer/events{/privacy}","received_events_url":"https://api.github.com/users/Luzifer/received_events","type":"User","site_admin":false}],"milestone":null,"comments":1,"created_at":"2016-09-14T15:14:41Z","updated_at":"2016-10-01T23:11:48Z","closed_at":"2016-10-01T23:11:48Z","body":"In order to speed up route calculation the path finding needs to be more efficient than the current solution.\r\n\r\n**Current solution**\r\n- All known systems are stored inside a slice\r\n- For each stop all systems are taken into account and the star with the least distance to the ideal (exact `N` Ly distance) next stop coordinates is selected as next stop\r\n\r\nThis solution is extremely slow as we need to traverse a slice of 2,596,070 star systems (steadily increasing) for each stop.\r\n\r\n**Possible solution**\r\n\r\nUtilizing a R-tree database ([dhconnelly/rtreego](https://github.com/dhconnelly/rtreego)?) should give a huge increase in calculation speed as the systems are addressable using their coordinates so we need to traverse only over a hand full of system searching for ideal conditions instead of taking a look at all 2.5 million systems."}}
{"actor":{"display_login":"Luzifer"}}