Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SOFSEM

2007

Springer

2007

Springer

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 speciﬁed 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 fulﬁlls certain conditions. We give two fast algorithms with diﬀerent preconditions. Second we give a linear programming (LP) formulation that always yields a drawing that fulﬁlls the above three requirements—if such a drawing exists. The size of our LP formulation is linear in the size of the graph.

Related Content

Added |
09 Jun 2010 |

Updated |
09 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
SOFSEM |

Authors |
Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang |

Comments (0)