Results 31 to 40 of about 4,519,520 (279)

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 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, Md. Jawaherul Alam, Md. Saidur Rahman   +2 more
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   +2 more sources

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

Finding Straight Lines and Curves in Engineering Line Drawings [PDF]

, 1987
This paper addresses the problem of distinguishing straight lines from curves in noisy gray tone images, and mathematically representing those lines and curves.
Sanford, J. Patrick, Bixler, J. Patrick, Watson, Layne T.   +2 more
core   +2 more sources

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, Marcel Radermacher, Ignaz Rutter   +2 more
doaj   +1 more source

Strictly-convex drawings of 3-connected planar graphs

Journal of Computational Geometry
Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings of $n$-vertex graphs is $O(n^2) \times O(n^2)$, as shown by ...
Michael Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis   +3 more
doaj   +1 more source

Upward Planar Drawings with Three and More Slopes

Journal of Graph Algorithms and Applications, 2023
The slope number of a graph $G$ is the smallest number of slopes needed for the segments representing the edges in any straight-line drawing of $G$. It serves as a measure of the visual complexity of a graph drawing.
Jonathan Klawitter, Johannes Zink
doaj   +1 more source

Ideal Drawings of Rooted Trees With Approximately Optimal Width

Journal of Graph Algorithms and Applications, 2017
For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not known whether
Therese Biedl
doaj   +1 more source