Abstract
Traditionally, the quality of orthogonal planar drawings is quantified by the total number of bends, or the maximum number of bends per edge. However, this neglects that in typical applications, edges have varying importance. We consider the problem OptimalFlexDraw that is defined as follows. Given a planar graph G on n vertices with maximum degree 4 (4-planar graph) and for each edge e a cost function \({\rm cost}_{e}: \mathbb{N}_{0} \longrightarrow \mathbb{R}\) defining costs depending on the number of bends e has, compute an orthogonal drawing of G of minimum cost.
In this generality OptimalFlexDraw is NP-hard. We show that it can be solved efficiently if 1) the cost function of each edge is convex and 2) the first bend on each edge does not cause any cost. Our algorithm takes time O(n ·T flow(n)) and O(n 2 ·T flow(n)) for biconnected and connected graphs, respectively, where T flow(n) denotes the time to compute a minimum-cost flow in a planar network with multiple sources and sinks. Our result is the first polynomial-time bend-optimization algorithm for general 4-planar graphs optimizing over all embeddings. Previous work considers restricted graph classes and unit costs.
Partly done within GRADR – EUROGIGA project no. 10-EuroGIGA-OP-003.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Biedl, T., Kant, G.: A Better Heuristic for Orthogonal Graph Drawings. Comput. Geom. 9(3), 159–180 (1998)
Bläsius, T., Krug, M., Rutter, I., Wagner, D.: Orthogonal graph drawing with flexibility constraints. Algorithmica (2012), doi:10.1007/s00453-012-9705-8
Bläsius, T., Rutter, I., Wagner, D.: Optimal orthogonal graph drawing with convex bend costs. CoRR abs/1204.4997 (2012), http://arxiv.org/abs/1204.4997
Di Battista, G., Liotta, G., Vargiu, F.: Spirality and Optimal Orthogonal Drawings. SIAM J. Comput. 27(6), 1764–1811 (1998)
Di Battista, G., Tamassia, R.: On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4), 302–318 (1996)
Di Battista, G., Tamassia, R.: On-Line Planarity Testing. SIAM J. Comput. 25(5), 956–997 (1996)
Garg, A., Tamassia, R.: On the Computational Complexity of Upward and Rectilinear Planarity Testing. SIAM J. Comput. 31(2), 601–625 (2001)
Gutwenger, C., Mutzel, P.: A Linear Time Implementation of SPQR-Trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77–90. Springer, Heidelberg (2001)
Tamassia, R.: On Embedding a Graph in the Grid with the Minimum Number of Bends. SIAM J. Comput. 16(3), 421–444 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bläsius, T., Rutter, I., Wagner, D. (2013). Optimal Orthogonal Graph Drawing with Convex Bend Costs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-39206-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39205-4
Online ISBN: 978-3-642-39206-1
eBook Packages: Computer ScienceComputer Science (R0)