Results 21 to 30 of about 7,574 (255)
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
Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
Journal of Graph Algorithms and Applications, 2004 Trees are usually drawn planar, i.e. without any edge-crossings. In this paper, we investigate the area requirement of (non-upward) planar straight-line grid drawings of binary trees. Let T be a binary tree with n nodes.
Ashim Garg, Adrian Rusu
doaj +1 more source
Straight-Line Drawing of Quadrangulations [PDF]
, 2007 This article introduces a straight-line drawing algorithm for quadrangulations, in the family of the face-counting algorithms. It outputs in linear time a drawing on a regular W×H grid such that W+H = n - 1 - Δ, where n is the number of vertices and Δ is an explicit combinatorial parameter of the quadrangulation.
openaire +1 more source
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
Journal of Graph Algorithms and Applications, 2011 A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings.
Md. Rezaul Karim +2 more
doaj +1 more source
GA for straight-line grid drawings of maximal planar graphs
Egyptian Informatics Journal, 2012 A straight-line grid drawing of a planar graph G of n vertices is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings.
Mohamed A. El-Sayed
doaj +1 more source
Drawing Planar Graphs with Reduced Height
Journal of Graph Algorithms and Applications, 2017 A polyline (resp., straight-line) drawing $\Gamma$ of a planar graph $G$ on a set $L_k$ of $k$ parallel lines is a planar drawing that maps each vertex of $G$ to a distinct point on $L_k$ and each edge of $G$ to a polygonal chain (resp ...
Stephane Durocher, Debajyoti Mondal
doaj +1 more source
Crossing Angles of Geometric Graphs
Journal of Graph Algorithms and Applications, 2014 We study the crossing angles of geometric graphs in the plane. We introduce the crossing angle number of a graph G, denoted can(G), which is the minimum number of angles between crossing edges in a straight-line drawing of G.
Karin Arikushi, Csaba Tóth
doaj +1 more source
Aligned Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2018 Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal A$ be an arrangement of pseudolines intersecting the drawing of $G$.
Tamara Mchedlidze +2 more
doaj +1 more source