In the first part i’ve introduced a way of aligning interconnected nodes in an optimal way. The methods used had some flaws that i discussed in the last article about dynamic network-graphs. In this article i would like to expand and improve the previous script.
What are you talking about??
First, here is the demo as it stands to date:
buildnetwork.svg
For details, please read on..
For the past couple of weeks i’ve been trying to find out how to visualize my referrer statistics visually. It would be a network nodes, each connected to some of the other nodes, via edges. The requirement of the visualization-engine would be the following:
- nodes must hold a specified distance to other nodes.
- interconnected nodes should try to get as close together as possible (they should still abide by the first rule)
- connections can be weighted, so that those with a higher weight would be preferred to be shorter
- each node has a mass - A higher mass results in slower motion and more stability.
- nodes can be fixed (not moving)
- the space used by the entire network should be minimized
To see an Example of my own implementation so far:
Omar | 4. April 2006
