No abstract

No abstract

No abstract

Many recent applications involve data models that rely on heterogeneous graphs (multiple node and relation types). Drawing these graphs is more difficult than drawing standard graphs, as it is desirable to take into account the heterogeneity of graphs in the form of constraints, possibly stemming from user preferences, to compute the layout. In this paper we propose a method for hierarchical graph drawing that is based on structural constraint modeling. These constraints are combined with crossing minimization algorithms to yield the desired visual effect. Three types of constraints are considered and illustrated, giving special attention to the drawing of multiple relations for interactive graph visualization.

No abstract