4 ms·
This has been most probably applied a force-directed layout: https://en.wikipedia.org/wiki/Force-directed_graph_drawing https://en.wikipedia.org/wiki/Force-dire
by Buetol 11y ago
This has been most probably applied a force-directed layout: https://en.wikipedia.org/wiki/Force-directed_graph_drawing https://en.wikipedia.org/wiki/Force-directed_graph_drawing
Basically, it's like having a spring between each node (paper) and letting the equilibrium do the rest.
- carlob 11y agoYes. From their facebook about page: > In laying out the map, an N-body algorithm is run to determine positions based on references between the papers. There are two “forces” involved in the N-body calculation: each paper is repelled from all other papers using an anti-gravity inverse-distance force, and each paper is attracted to all of its references using a spring modelled by Hooke’s law. However it must have taken them a while to converge for 10^6 particles.
- Buetol 11y agoIt's actually pretty fast now, could take max one day to get something like that with https://github.com/anvaka/ngraph.offline.layout https://github.com/anvaka/ngraph.offline.layout