21 citations · 120 across the 54 of their papers we have counts for
5 papers · 1 filter
Planar Embeddings with Small and Uniform Faces
Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl +1
Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-gra…
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
An -path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from to any point on the curve the distance to is non-incr…
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…
Evaluation of Labeling Strategies for Rotating Maps
Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
We consider the following problem of labeling points in a dynamic map that allows rotation. We are given a set of points in the plane labeled by a set of mutually disjoint labels,…
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…