Results 21 to 30 of about 4,519,520 (279)
On the Perspectives Opened by Right Angle Crossing Drawings
Journal of Graph Algorithms and Applications, 2011 Right Angle Crossing (RAC) drawings are polyline drawings where each crossing forms four right angles. RAC drawings have been introduced because cognitive experiments provided evidence that increasing the number of crossings does not decrease the ...
Patrizio Angelini +6 more
doaj +1 more source
Geometric RAC Simultaneous Drawings of Graphs
Journal of Graph Algorithms and Applications, 2013 In this paper, we study the geometric RAC simultaneous drawing problem: Given two planar graphs that share a common vertex set, a geometric RAC simultaneous drawing is a straight-line drawing in which each graph is drawn planar, there are no edge ...
Evmorfia Argyriou +3 more
doaj +1 more source
Drawing Halin-graphs with small height
Journal of Graph Algorithms and Applications, 2022 In this paper, we study how to draw Halin-graphs, i.e., planar graphs that consist of a tree $T$ and a cycle among the leaves of that tree. Based on tree-drawing algorithms and the pathwidth $pw(T) $, a well-known graph parameter, we find poly-line ...
Therese Biedl, Milap Sheth
doaj +1 more source
On Extending a Partial Straight-Line Drawing [PDF]
International Journal of Foundations of Computer Science, 2006 We investigate the computational complexity of the following problem. Given a planar graph in which some vertices have already been placed in the plane, place the remaining vertices to form a planar straight-line drawing of the whole graph. We show that this extensibility problem, proposed in the 2003 "Selected Open Problems in Graph Drawing" [1], is ...
openaire +3 more sources
Non-aligned Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2017 A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have a non-aligned planar straight-line drawing in the $n\times n$-grid.
Therese Biedl, Claire Pennarun
doaj +1 more source
A Note on Minimum-Segment Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2013 A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex is mapped to a point on the Euclidean plane, each edge is drawn as a straight line segment, and no two edges intersect except possibly at a common endpoint ...
Stephane Durocher +3 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2019 We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We assume that a crossing-minimization algorithm is applied first, yielding a planarization, i.e., a planar graph with a dummy vertex for each ...
Thomas Bläsius +2 more
doaj +1 more source
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
Journal of Graph Algorithms and Applications, 2012 We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential area, our method ...
Erin Chambers +3 more
doaj +1 more source
Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width)
Journal of Graph Algorithms and Applications, 2020 In this paper, we study how to draw trees so that they are planar, straight-line and respect a given order of edges around each node. We focus on minimizing the height, and show that we can always achieve a height of at most $2pw(T)+1$, where $pw(T ...
Johannes Batzill, Therese Biedl
doaj +1 more source