Results 21 to 30 of about 28,541 (252)

Drawing planar graphs with many collinear vertices

open access: yesJournal of Computational Geometry, 2018
Consider the following problem: Given a planar graph $G$, what is the maximum number $p$ such that $G$ has a planar straight-line drawing with $p$ collinear vertices?
Giordano Da Lozzo   +4 more
doaj   +1 more source

Straight-Line Drawing of Quadrangulations [PDF]

open access: yes, 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

Pole Dancing: 3D Morphs for Tree Drawings

open access: yesJournal of Graph Algorithms and Applications, 2019
We study the question whether a crossing-free 3D morph between two straight-line drawings of an $n$-vertex tree $T$ can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two-
Elena Arseneva   +7 more
doaj   +1 more source

On a Tree and a Path with no Geometric Simultaneous Embedding

open access: yesJournal of Graph Algorithms and Applications, 2012
Two graphs G1=(V,E1) and G2=(V,E2) admit a geometric simultaneous embedding if there exist a set of points P and a bijection M: V→ P that induce planar straight-line embeddings both for G1 and for G2.
Patrizio Angelini   +3 more
doaj   +1 more source

On the planar edge-length ratio of planar graphs

open access: yesJournal of Computational Geometry, 2020
The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight ...
Manuel Borrazzo, Fabrizio Frati
doaj   +1 more source

On the Perspectives Opened by Right Angle Crossing Drawings

open access: yesJournal 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

Column planarity and partially-simultaneous geometric embedding

open access: yesJournal of Graph Algorithms and Applications, 2017
We introduce the notion of column planarity of a subset $R$ of the vertices of a graph $G$. Informally, we say that $R$ is column planar in $G$ if we can assign $x$-coordinates to the vertices in $R$ such that any assignment of $y$-coordinates to ...
Luis Barba   +5 more
doaj   +1 more source

Mathematical Modeling of Heating and Strain Aging of Steel during High-Speed Wire Drawing

open access: yesMetals, 2022
In this article, a mathematical model of the wire’s average temperature change in the process of multiple drawing on high-speed straight-line drawing machines has been developed.
Liudmila V. Radionova   +8 more
doaj   +1 more source

Monotone Drawings of Graphs

open access: yesJournal of Graph Algorithms and Applications, 2012
We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction.
Patrizio Angelini   +4 more
doaj   +1 more source

Morphing Planar Graph Drawings Through 3D

open access: yesComputing in Geometry and Topology, 2023
In this paper, we investigate crossing-free 3D morphs between planar straight-line drawings. We show that, for any two (not necessarily topologically equivalent) planar straight-line drawings of an n-vertex planar graph, there exists a piecewise-linear ...
Kevin Buchin   +6 more
doaj   +1 more source

Home - About - Disclaimer - Privacy