Results 11 to 20 of about 7,574 (255)
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms.
Giuseppe Di Battista, Fabrizio Frati
doaj +1 more source
The Complexity of Angular Resolution
Journal of Graph Algorithms and Applications, 2023 The angular resolution of a straight-line drawing of a graph is the smallest angle formed by any two edges incident to a vertex. The angular resolution of a graph is the supremum of the angular resolutions of all straight-line drawings of the graph.
Marcus Schaefer
doaj +1 more source
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 +2 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