Closed CodeFetch closed 3 years ago
We use d3-force to visualize our mesh network connections. Unfortunately the resulting graphs are not very handsome (especially with non-planar graphs): https://hannover.freifunk.net/karte/#/en/graph/18a6f73de51a
So I thought wouldn't it make sense to use a sping network approach instead? What I hope is that we can make graphs better human-readable by e.g. finding out the edge vertices of non-planar partitions of the graph, splitting it there and moving it apart so that it does not end up as a clumsy ball. https://m.youtube.com/watch?v=CDMQR422LGM Edit: For people who prefer to read: https://blogs.ams.org/jmm2019/2019/01/18/dan-spielman-miracles-of-algebraic-graph-theory/
Closed as I've found out that d3-force used spring networks before and I've found a better solution for my problem.
We use d3-force to visualize our mesh network connections. Unfortunately the resulting graphs are not very handsome (especially with non-planar graphs): https://hannover.freifunk.net/karte/#/en/graph/18a6f73de51a
So I thought wouldn't it make sense to use a sping network approach instead? What I hope is that we can make graphs better human-readable by e.g. finding out the edge vertices of non-planar partitions of the graph, splitting it there and moving it apart so that it does not end up as a clumsy ball. https://m.youtube.com/watch?v=CDMQR422LGM Edit: For people who prefer to read: https://blogs.ams.org/jmm2019/2019/01/18/dan-spielman-miracles-of-algebraic-graph-theory/