Results 1 to 10 of about 345 (104)
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
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
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
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
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
The Straight-Line RAC Drawing Problem is NP-Hard
Journal of Graph Algorithms and Applications, 2012 A RAC drawing of a graph is a polyline drawing in which every pair of crossing edges intersects at right angle. In this paper, we focus on straight-line RAC drawings and demonstrate an infinite class of graphs with unique RAC combinatorial embedding.
Evmorfia Argyriou +2 more
doaj +1 more source
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
Journal of Graph Algorithms and Applications, 2004 An exact formula is given for the maximum number of edges in a graph that admits a three-dimensional grid-drawing contained in a given bounding box.
Prosenjit Bose +3 more
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
Известия высших учебных заведений России: Радиоэлектроника, 2020 Introduction. Modern antenna devices contain a large number of repeating elements. The process of development of CAD models of such devices requires repeatedly performed operations that is a routine task for an engineer.
V. G. Koshkid’ko, M. M. Migalin
doaj +1 more source