Hacker News new | past | comments | ask | show | jobs | submit login

This has been most probably applied a force-directed layout: 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.




Yes. 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.


It's actually pretty fast now, could take max one day to get something like that with https://github.com/anvaka/ngraph.offline.layout




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: