matchoman

MatchOMan

Keywords

Matched Graph Drawings
Crossing Minimization
Aesthetic Criteria
Orthogonal Drawings
Constrained Planarization


MatchOMan: visualization of One-to-Many Matched drawings

It is a system for the display and the visual analysis of two graphs G1 and G2 such that each Gi is defined on a different data set with its own primary relationships and there are secondary relationships between the vertices of G1 and those of G2. The main goal of the system is to compute a drawing of G1 and G2 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.

Publications