Simple Algorithms for Network Visualization:A Tutorial |
| |
Authors: | Michael JMcGuffin |
| |
Institution: | Michael J.McGuffin Department of Software and IT Engineering,cole de technologie suprieure,Montral H3C 1K3,Canada |
| |
Abstract: | The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data,often involving complicated algorithms that are difficult for the uninitiated to learn.This article is intended for beginners who are interested in programming their own network visualizations,or for those curious about some of the basic mechanics of graph visualization.Four easy-to-program network layout techniques are discussed,with details given for implementing each one:force-directed node-link diagrams,arc diagrams,adjacency matrices,and circular layouts.A Java applet demonstrating these layouts,with open source code,is available at http://www.michaelmcguffin.com/research/simpleNetVis/.The end of this article also briefly surveys research topics in graph visualization,pointing readers to references for further reading. |
| |
Keywords: | network visualization graph visualization graph drawing node-link diagram force-directed layout arc diagram adjacency matrix circular layout tutorial |
本文献已被 CNKI 等数据库收录! |
|