Results 1 to 10 of about 352 (118)
Polyline drawings with topological constraints [PDF]
Theoretical Computer Science, 2020 Let $G$ be a simple topological graph and let $Γ$ be a polyline drawing of $G$. We say that $Γ$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of crossings as $G$. Drawing $Γ$ fully preserves the topology of $G$ if the planarization of $G$ and the planarization of $Γ$ have
Fabrizio Montecchiani +2 more
exaly +6 more sources
Planar L-Drawings of Bimodal Graphs
Journal of Graph Algorithms and Applications, 2022 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 ending at the head of $e$. Distinct edges may overlap, but not cross.
Patrizio Angelini +3 more
doaj +1 more source
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A k-stack layout (respectively, k-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +2 more sources
A Framework for Drawing Planar Graphs with Curves and Polylines [PDF]
Journal of Algorithms, 1998 Summary: We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties of such drawings, including aspect ratio, vertex resolution, edge length, edge separation, and edge curvature, as well as complexity measures such as vertex and ...
Michael T. Goodrich +1 more
openaire +1 more source
On Planar Polyline Drawings [PDF]
, 2008 We present a linear time algorithm that produces a planar polyline drawing for a plane graph with n vertices in a grid of size bounded by (p + 1) × (n - 2), where p ≤ (⌊2n-5/3⌋). It uses at most p ≤ ⌊2n-5/3⌋ bends, and each edge uses at most one bend.
Huaming Zhang, Sadish Sadasivam
openaire +1 more source
B0-VPG Representation of AT-free Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2023 A $k$-bend path is a non-self-intersecting polyline in the plane made of at most $k+1$ axis-parallel line segments. B$_{k}$-VPG is the class of graphs which can be represented as intersection graphs of $k$-bend paths in the same plane. In this paper,
Sparsh Jain +2 more
doaj +1 more source
Trade-Offs in Planar Polyline Drawings [PDF]
, 2014 Angular resolution, area and the number of bends are some important aesthetic criteria of a polyline drawing. Although trade-offs among these criteria have been examined over the past decades, many of these trade-offs are still not known to be optimal. In this paper we give a new technique to compute polyline drawings for planar triangulations.
Stephane Durocher, Debajyoti Mondal
openaire +1 more source
Journal of Graph Algorithms and Applications, 2017 We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber +3 more
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
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