In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different algorithms for simultaneous graph drawing and three different visualization schemes. The algorithms are based on a modification of the force-directed algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining individually readable drawings. The implementation is in Java and the system can be downloaded at http://simg.cs.arizona.edu/.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
Stephen G. Kobourov
- Springer Berlin Heidelberg
ec4u, Neuer Inhalt/© ITandMEDIA