Results 21 to 30 of about 1,651,918 (300)
Drawing Graphs as Spanners [PDF]
Discrete & Computational Geometry, 2020 We study the problem of embedding graphs in the plane as good geometric spanners. That is, for a graph $G$, the goal is to construct a straight-line drawing $Γ$ of $G$ in the plane such that, for any two vertices $u$ and $v$ of $G$, the ratio between the minimum length of any path from $u$ to $v$ and the Euclidean distance between $u$ and $v$ is small.
Oswin Aichholzer +6 more
openaire +6 more sources
Equilateral Spherical Drawings of Planar Cayley Graphs
Journal of Graph Algorithms and Applications, 2021 In this paper, we study equilateral spherical drawings of planar Cayley graphs. We focus on the case when the underlying group is generated by two rotations.
Ming-Hsuan Kang, Wu-Hsiung Lin
doaj +1 more source
Lombardi Drawings of Graphs [PDF]
Journal of Graph Algorithms and Applications, 2011 We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex.
Christian A. Duncan +4 more
openaire +3 more sources
-shaped point set embeddings of high-degree plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source
On Strict (Outer-)Confluent Graphs
Journal of Graph Algorithms and Applications, 2021 A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and arcs.
Henry Förster +3 more
doaj +1 more source
Drawing Graphs on a Smartphone [PDF]
Journal of Graph Algorithms and Applications, 2011 Summary: We present a system for the visualization of information modeled in terms of a graph on a smartphone. First, we show the adopted visualization paradigm, that allows the user to navigate the graph using a focus-based approach. Second, we tackle the algorithmic challenges posed by the new visualization paradigm, introducing and experimenting ...
Giordano Da Lozzo +2 more
openaire +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
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Bend-optimal orthogonal drawings of triconnected plane graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A drawing of a plane graph G in which each edge is represented by a sequence of alternating horizontal and vertical line segments is called an orthogonal drawing.
Siddharth Bhatia, Kunal Lad, Rajiv Kumar
doaj +2 more sources
, 2010 This report describes the 16th Annual Graph Drawing Contest, held in conjunction with the 2009 Graph Drawing Symposium in Chicago, USA.
Gutwenger, Carsten +7 more
core +3 more sources