Straightening Drawings of Clustered Hierarchical Graphs

In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane drawing of G (with y-monotone edges) can be specified by stating for each layer the order of the vertices lying on and the edges intersecting that layer. Given these orders and a recursive partition of the vertices into clusters, we want to draw G such that (i) edges are straight-line segments, (ii) clusters lie in disjoint convex regions, (iii) no edge intersects a cluster boundary twice. First we investigate fast algorithms that produce drawings of the above type if the clustering fulfills certain conditions. We give two fast algorithms with different preconditions. Second we give a linear programming (LP) formulation that always yields a drawing that fulfills the above three requirements—if such a drawing exists. The size of our LP formulation is linear in the size of the graph.

• Type: Conference
• Year: 2007
• Where: SOFSEM
• Authors: Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang
• Keywords: Disjoint Convex Regions, Fast Algorithms, Hierarchical Graphs Nicer, SOFSEM 2007, Theoretical Computer Science