12 citations · 57 across the 39 of their papers we have counts for
55 papers
Beyond Degree Four: Near-Orthogonal Planar Drawings
Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo +2
Orthogonal planar drawings constitute a classical and mainstream research topic in graph drawing due to their clarity and wide applicability. In an orthogonal planar drawing of a g…
Upward-Planar Drawings with Bounded Span
Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo +4
We consider upward-planar layered drawings of directed graphs, i.e., crossing-free drawings in which each edge is drawn as a y-monotone curve going upward from its tail to its head…
On Planar Straight-Line Dominance Drawings
Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista +3
We study the following question, which has been considered since the 90's: Does every -planar graph admit a planar straight-line dominance drawing? We show concrete evidence fo…
Geometric realizations of dichotomous ordinal graphs
Patrizio Angelini, Sabine Cornelsen, Carolina Haase +5
A dichotomous ordinal graph consists of an undirected graph with a partition of the edges into short and long edges. A geometric realization of a dichotomous ordinal graph in a…
Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces
Patrizio Angelini, Carla Binucci, Giuseppe Di Battista +5
Unit edge-length drawings, rectilinear drawings (where each edge is either a horizontal or a vertical segment), and rectangular face drawings are among the most studied subjects in…
The Price of Upwardness
Patrizio Angelini, Therese Biedl, Markus Chimani +8
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyon…
Axis-Parallel Right Angle Crossing Graphs
Patrizio Angelini, Michael A. Bekos, Julia Katheder +3
A RAC graph is one admitting a RAC drawing, that is, a polyline drawing in which each crossing occurs at a right angle. Originally motivated by psychological studies on readability…
Splitting Vertices in 2-Layer Graph Drawings
Reyan Ahmed, Patrizio Angelini, Michael A. Bekos +8
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two…
Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)
Patrizio Angelini, Reinhard von Hanxleden
This is the arXiv index for the electronic proceedings of GD 2022, which is held at the Tokyo Institute of Technology, Tokyo, Japan, on September 13 - 16, 2022. It contains the pee…
RAC Drawings of Graphs with Low Degree
Patrizio Angelini, Michael A. Bekos, Julia Katheder +2
Motivated by cognitive experiments providing evidence that large crossing-angles do not impair the readability of a graph drawing, RAC (Right Angle Crossing) drawings were introduc…
Recognizing Map Graphs of Bounded Treewidth
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo +3
A map graph is a graph admitting a representation in which vertices are nations on a spherical map and edges are shared curve segments or points between nations. We present an expl…
On Upward-Planar L-Drawings of Graphs
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +1
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge is represented as a polyline composed of a vertical segment with its lowest endpoint at the tail of $e…
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
Patrizio Angelini, Philipp Kindermann, Andre Löffler +2
We consider the problem of drawing an outerplanar graph with vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it ca…
On Morphing 1-Planar Drawings
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani +1
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of p…
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +2
Given a bipartite graph , the -Level Quasi-Planarity problem asks for the existence of a drawing of in the plane such that the vertices in and in …
On Mixed Linear Layouts of Series-Parallel Graphs
Patrizio Angelini, Michael A. Bekos, Philipp Kindermann +1
A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same…
Extending Partial Orthogonal Drawings
Patrizio Angelini, Ignaz Rutter, Sandhya T P
We study the planar orthogonal drawing style within the framework of partial representation extension. Let be a partial orthogonal drawing, i.e., G is a graph, $H\subs…
-Layer -Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth
Patrizio Angelini, Giordano Da Lozzo, Henry Förster +1
The -layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, howe…
Planar L-Drawings of Bimodal Graphs
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +1
In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment endin…
Simple -Planar Graphs are Simple -Quasiplanar
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8
A simple topological graph is -quasiplanar () if it contains no pairwise crossing edges, and -planar if no edge is crossed more than times. In this paper, we…
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on…
The QuaSEFE Problem
Patrizio Angelini, Henry Förster, Michael Hoffmann +4
We initiate the study of Simultaneous Graph Embedding with Fixed Edges in the beyond planarity framework. In the QuaSEFE problem, we allow edge crossings, as long as each graph ind…
Morphing Contact Representations of Graphs
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +2
We consider the problem of morphing between contact representations of a plane graph. In an -contact representation of a plane graph , vertices are realized by inter…
On RAC Drawings of Graphs with one Bend per Edge
Patrizio Angelini, Michael A. Bekos, Henry Förster +1
A k-bend right-angle-crossing drawing or (k-bend RAC drawing}, for short) of a graph is a polyline drawing where each edge has at most k bends and the angles formed at the crossing…