21 citations · 44 across the 25 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.CG2014★ 1 cited
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
Thomas Bläsius, Guido Brückner, Ignaz Rutter
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which…
cs.DS2014
Orthogonal Graph Drawing with Inflexible Edges
Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
We consider the problem of creating plane orthogonal drawings of 4-planar graphs (planar graphs with maximum degree 4) with constraints on the number of bends per edge. More precis…