Self-Organization applied to Dynamic Network Layout TeX Export

@article{citeulike:1237774, abstract = {As networks and their structure have become a major field of research, a strong demand for network visualization has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus open up the design space for new algorithms. Drawing from the knowledge of systems design, we derive a layout algorithm that remedies several drawbacks of the original spring layout. This new algorithm relies on the balancing of two antagonistic forces. We thus call it {\em arf} for "attractive and repulsive forces". It is, as we claim, particularly suited for a dynamic layout of smaller networks (\$n \< 10^3\$). We back this claim with several application examples from on going complex systems research.}, archivePrefix = {arXiv}, author = {Geipel, Markus M.}, citeulike-article-id = {1237774}, citeulike-linkout-0 = {http://arxiv.org/abs/0704.1748}, citeulike-linkout-1 = {http://arxiv.org/pdf/0704.1748}, day = {20}, eprint = {0704.1748}, keywords = {2007, graph, layout, repulsion, spring}, month = {Jan}, posted-at = {2009-08-27 16:50:35}, priority = {0}, title = {Self-Organization applied to Dynamic Network Layout}, url = {http://arxiv.org/abs/0704.1748}, year = {2009} }

TY - JOUR ID - citeulike:1237774 L3 - citeulike-article-id:1237774 N2 - As networks and their structure have become a major field of research, a strong demand for network visualization has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus open up the design space for new algorithms. Drawing from the knowledge of systems design, we derive a layout algorithm that remedies several drawbacks of the original spring layout. This new algorithm relies on the balancing of two antagonistic forces. We thus call it {\em arf} for "attractive and repulsive forces". It is, as we claim, particularly suited for a dynamic layout of smaller networks ($n < 10^3$). We back this claim with several application examples from on going complex systems research. TI - Self-Organization applied to Dynamic Network Layout KW - 2007 KW - graph KW - layout KW - repulsion KW - spring AU - Geipel, Markus PY - 2009/Jan/20/ UR - http://arxiv.org/abs/0704.1748 ER -