Zobrazeno 1 - 10
of 222
pro vyhledávání: '"Di giacomo, Emilio"'
Autor:
Di Giacomo, Emilio, Förster, Henry, Kokhovich, Daria, Mchedlidze, Tamara, Montecchiani, Fabrizio, Symvonis, Antonios, Villedieu, Anaïs
We study the upward point-set embeddability of digraphs on one-sided convex point sets with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point-set embedding of outerplanar $st$-digraphs on arbitrary one-sided convex poi
Externí odkaz:
http://arxiv.org/abs/2401.03226
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen
The \emph{local edge-length ratio} of a planar straight-line drawing $\Gamma$ is the largest ratio between the lengths of any pair of edges of $\Gamma$ that share a common vertex. The \emph{global edge-length ratio} of $\Gamma$ is the largest ratio b
Externí odkaz:
http://arxiv.org/abs/2311.14634
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Montecchiani, Fabrizio, Ortali, Giacomo
Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to test the existence of a rectilinear planar drawing, i.e., an orthogona
Externí odkaz:
http://arxiv.org/abs/2308.13665
This paper studies a \emph{packing} problem in the so-called beyond-planar setting, that is when the host graph is ``almost-planar'' in some sense. Precisely, we consider the case that the host graph is $k$-planar, i.e., it admits an embedding with a
Externí odkaz:
http://arxiv.org/abs/2301.01226
Autor:
Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Symvonis, Antonios
Motivated by dynamic graph visualization, we study the problem of representing a graph $G$ in the form of a \emph{storyplan}, that is, a sequence of frames with the following properties. Each frame is a planar drawing of the subgraph of $G$ induced b
Externí odkaz:
http://arxiv.org/abs/2209.00453
Autor:
Chaplick, Steven, Di Giacomo, Emilio, Frati, Fabrizio, Ganian, Robert, Raftopoulou, Chrysanthi N., Simonov, Kirill
We present an $O(n^2)$-time algorithm to test whether an $n$-vertex directed partial $2$-tree is upward planar. This result improves upon the previously best known algorithm, which runs in $O(n^4)$ time.
Comment: Appears in the Proceedings of th
Comment: Appears in the Proceedings of th
Externí odkaz:
http://arxiv.org/abs/2208.12548
Autor:
Chaplick, Steven, Di Giacomo, Emilio, Frati, Fabrizio, Ganian, Robert, Raftopoulou, Chrysanthi N., Simonov, Kirill
We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an XP-algori
Externí odkaz:
http://arxiv.org/abs/2203.05364
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of bends per edge is minimized. We prove that every bimodal plane digraph ad
Externí odkaz:
http://arxiv.org/abs/2108.10784
Hybrid visualizations mix different metaphors in a single layout of a network. In particular, the popular NodeTrix model, introduced by Henry, Fekete, and McGuffin in 2007, combines node-link diagrams and matrix-based representations to support the a
Externí odkaz:
http://arxiv.org/abs/2108.10270