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.
Visual Analysis of One-To-Many Matched Graphs
DI GIACOMO, Emilio;DIDIMO, WALTER;LIOTTA, Giuseppe;
2009
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
