Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Zink, Johannes"'
Autor:
Blažej, Václav, Klemz, Boris, Klesen, Felix, Sieper, Marie Diana, Wolff, Alexander, Zink, Johannes
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant Constrained Leve
Externí odkaz:
http://arxiv.org/abs/2403.13702
Autor:
Firman, Oksana, Kindermann, Philipp, Klemz, Boris, Ravsky, Alexander, Wolff, Alexander, Zink, Johannes
We study the following combinatorial problem. Given a set of $n$ y-monotone \emph{wires}, a \emph{tangle} determines the order of the wires on a number of horizontal \emph{layers} such that the orders of the wires on any two consecutive layers differ
Externí odkaz:
http://arxiv.org/abs/2312.16213
Autor:
Firman, Oksana, Hegemann, Tim, Klemz, Boris, Klesen, Felix, Sieper, Marie Diana, Wolff, Alexander, Zink, Johannes
A crossing-free morph is a continuous deformation between two graph drawings that preserves straight-line pairwise noncrossing edges. Motivated by applications in 3D morphing problems, we initiate the study of morphing graph drawings in the plane in
Externí odkaz:
http://arxiv.org/abs/2311.14516
We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \emph{storyplan}, and each drawing in the sequence is called a \emph{fram
Externí odkaz:
http://arxiv.org/abs/2311.13523
Autor:
Klawitter, Jonathan, Zink, Johannes
Our goal is to visualize an additional data dimension of a tree with multifaceted data through superimposition on vertical strips, which we call columns. Specifically, we extend upward drawings of unordered rooted trees where vertices have assigned h
Externí odkaz:
http://arxiv.org/abs/2308.10811
Autor:
Gutowski, Grzegorz, Junosza-Szaniawski, Konstanty, Klesen, Felix, Rzążewski, Paweł, Wolff, Alexander, Zink, Johannes
A \emph{mixed interval graph} is an interval graph that has, for every pair of intersecting intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are particularly interested in scenarios where edges and arcs are defined by the g
Externí odkaz:
http://arxiv.org/abs/2303.07960
We study the crossing-minimization problem in a layered graph drawing of planar-embedded rooted trees whose leaves have a given total order on the first layer, which adheres to the embedding of each individual tree. The task is then to permute the ve
Externí odkaz:
http://arxiv.org/abs/2302.11952
Autor:
Gutowski, Grzegorz, Mittelstädt, Florian, Rutter, Ignaz, Spoerhase, Joachim, Wolff, Alexander, Zink, Johannes
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that assigns to each vertex in $G$ a positive integer such that, for each edge $uv$ in $G$, $c(u) \ne
Externí odkaz:
http://arxiv.org/abs/2208.14250
Autor:
Goeßmann, Ina, Klawitter, Jonathan, Klemz, Boris, Klesen, Felix, Kobourov, Stephen, Kryven, Myroslav, Wolff, Alexander, Zink, Johannes
The segment number of a planar graph $G$ is the smallest number of line segments needed for a planar straight-line drawing of $G$. Dujmovi\'c, Eppstein, Suderman, and Wood [CGTA'07] introduced this measure for the visual complexity of graphs. There a
Externí odkaz:
http://arxiv.org/abs/2202.11604
Autor:
Storandt, Sabine, Zink, Johannes
Given a polyline on $n$ vertices, the polyline simplification problem asks for a minimum size subsequence of these vertices defining a new polyline whose distance to the original polyline is at most a given threshold under some distance measure, usua
Externí odkaz:
http://arxiv.org/abs/2201.01344