Timeline for Efficient datastructure to store a galaxy map
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2015 at 23:31 | vote | accept | Systemsfailed | ||
| Oct 30, 2015 at 20:10 | comment | added | Engineer | See edit, my original answer was far from complete. | |
| Oct 30, 2015 at 19:56 | comment | added | wondra | It is only fairly quick O(N) test (two multiplications, one addition) or just one condition if you precomputed it in 2D array... see the Arcane Engineers answer - the talk about this started there. Problem with 2D array might be the memory 4*N bytes. | |
| Oct 30, 2015 at 19:56 | comment | added | Engineer | An octree is overkill for this, IMO. | |
| Oct 30, 2015 at 19:50 | comment | added | Systemsfailed | So what are you suggesting, that every time I check all available jump targets in range I iterate through the entire collection of all systems to determine what's in range? | |
| Oct 30, 2015 at 19:43 | answer | added | Engineer | timeline score: 2 | |
| Oct 30, 2015 at 19:43 | comment | added | wondra | Why would you store graph if it is 1.) complete graph with 2.) well-known edge weight(and easily computable!)? All the information is implicit given by already existing attribute(position). | |
| Oct 30, 2015 at 18:58 | review | First posts | |||
| Oct 30, 2015 at 20:35 | |||||
| Oct 30, 2015 at 18:57 | history | asked | Systemsfailed | CC BY-SA 3.0 |