Timeline for Algorithm to design a graphic of a set of connections between nodes
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Aug 7, 2016 at 3:16 | comment | added | Nick Pandolfi | Thats a good point. Alone this might not be the best solution, however I was thinking that this method paired with a force directed graphing system would work nice. The line intersection detections would help drastically by untangling the mess. See this: bl.ocks.org/mbostock/4062045 | |
| Aug 7, 2016 at 0:00 | comment | added | Dan Pichelman | I had a feeling that was the case. Check the link in my answer - they talk about filtering out a lot of segments that couldn't possibly intersect (e.g., both points of segment 1 are above both points of segment 2) | |
| Aug 6, 2016 at 1:30 | comment | added | Nick Pandolfi | There could be up to 100,000 points at a given time, so I was looking for a way in which one would not have to do it manually like that. If I had to check all the connections then that would be O(n^2) or even longer with additional constraints. I wanted something more 'automatic' in a sense. | |
| Aug 6, 2016 at 1:26 | history | answered | Dan Pichelman | CC BY-SA 3.0 |