Abstract Traditionally, the quality of orthogonal planar drawings is quantified by either the total number of bends, or the maximum number of bends per edge. However, this neglects that in typical applications, edges have varying importance. In this work, we investigate an approach that allows to specify the maximum number of bends for each edge individually, depending on its importance. We consider a new problem called FLEXDRAW that is defined as follows. Given a planar graph G = (V , E) on n vertices with maximum degree 4 and a function flex : E −→ N 0 that assigns a flexibility to each edge, does G admit a planar embedding on the grid such that each edge e has at most flex(e) bends? Note that in our setting the combinatorial embedding of G is not fixed. FLEXDRAW directly extends the problem β-embeddability asking whether G can be embedded with at most β bends per edge. We give an algorithm with running-time O(n 2 ) solving FLEXDRAW when the flexibility of each edge is positive. This includes 1-embeddability as a special case and thus closes the complexity gap between 0-embeddability, which is N P-hard to decide, and 2-embeddability, which is efficiently solvable since every planar graph with maximum degree 4 admits a 2-embedding except for the octahedron. In addition to the polynomial-time algorithm we show that FLEXDRAW is N P-hard even if the edges with flexibility 0 induce a tree or a union of disjoint stars.
On the other hand, not all 4-planar graphs admit orthogonal drawings with one bend per edge; however, testing whether a 4-planar graph admits such a drawing can be done in polynomial time REF .
Orthogonal Graph Drawing with Flexibility Constraints
Algorithmica
Algorithmica
Mathematics Computer Science