Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
Theory of Computing Systems
Network Visualization by Semantic Substrates
IEEE Transactions on Visualization and Computer Graphics
On simultaneous planar graph embeddings
Computational Geometry: Theory and Applications
VisLink: Revealing Relationships Amongst Visualizations
IEEE Transactions on Visualization and Computer Graphics
Matched drawings of planar graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Multi-circular layout of micro/macro graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Motivated by applications of social network analysis and of Web- search clustering engines, we describe an algorithm and a system for the display and the visual analysis of two graphs G 1 and G 2 such that each G i is defined on a different data set with its own primary relationships and there are secondary relationships between the vertices of G 1 and those of G 2 . Our main goal is to compute a drawing of G 1 and G 2 that makes clearly visible the relations between the two graphs by avoiding their crossings, and that also takes into account some other important aesthetic requirements like number of bends, area, and aspect ratio. Application examples and experiments on the system performances are also presented.