Results 11 to 20 of about 57,181 (227)
Graph Drawing Contest Report [PDF]
Journal of Graph Algorithms and Applications, 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 +5 more sources
The Graph Drawing Server [PDF]
, 2002 There are many obstacles in the way of someone wishing to make use of existing graph drawing technology -- software installation and data conversion can be time-consuming and may be prohibitively difficult for the casual or novice user, and software may ...
Bridgeman, Stina +3 more
core +2 more sources
Graph-Drawing Contest Report [PDF]
, 1995 This report describes the Second Annual Graph Drawing Contest, held in conjuction with the 1995 Graph Drawing Symposium in Passau, Germany. The purpose of the contest is to both monitor and challenge the current state of the art in graph-drawing ...
Eades, Peter, Marks, Joe
core +3 more sources
Graph-Drawing Contest Report [PDF]
, 1997 This report describes the Third Annual Graph Drawing Contest, held in conjunction with the 1996 Graph Drawing Symposium in Berkeley, California. The purpose of the contest is to monitor and challange the current state of the art in graph-drawing ...
North, Stephen, Eades, Peter, Marks, Joe
core +3 more sources
Coloring Drawings of Graphs [PDF]
The Electronic Journal of Combinatorics, 2022 We consider cell colorings of drawings of graphs in the plane. Given a multi-graph $G$ together with a drawing $\Gamma(G)$ in the plane with only finitely many crossings, we define a cell $k$-coloring of $\Gamma(G)$ to be a coloring of the maximal connected regions of the drawing, the cells, with $k$ colors such that adjacent cells have different ...
Christoph Hertrich +2 more
openaire +2 more sources
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 +4 more sources
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
Monotone Drawings of Graphs [PDF]
Journal of Graph Algorithms and Applications, 2011 Summary: 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. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between
Patrizio Angelini +4 more
openaire +3 more sources
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 +2 more sources
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