Results 31 to 40 of about 1,651,918 (300)
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
, 2012 Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +1 more source
Journal of Graph Algorithms and Applications, 2005 Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality.
Paul Holleis +2 more
openaire +1 more source
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journal of Graph Algorithms and Applications, 2009 A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings.
Md. Rezaul Karim, Md. Saidur Rahman
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
Journal of Graph Algorithms and Applications, 2017 One of the most popular hierarchical graph drawing frameworks - the Sugiyama, Tagawa, and Toda (STT) framework - often introduces dummy vertices to the given directed acyclic graph as part of its methodology to produce the final drawing. The inclusion of
Daniel Summer Magruder, Stefan Bonn
doaj +1 more source
, 2002 This report describes the Ninth Annual Graph Drawing Contest, held in conjuction with the 2002 Graph Drawing Symposium in Irvine, California.
Brandenburg, Franz J. +1 more
core +2 more sources
Graph Drawing by High-Dimensional Embedding
Journal of Graph Algorithms and Applications, 2004 We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the
David Harel, Yehuda Koren
doaj +1 more source
Drawing a Graph in a Hypercube [PDF]
The Electronic Journal of Combinatorics, 2006 A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions in hypercube drawing of a given graph.
openaire +4 more sources
Convex Grid Drawings of Plane Graphs with Rectangular Contours
Journal of Graph Algorithms and Applications, 2008 In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex grid drawing, all vertices are put on grid points.
Kazuyuki Miura +2 more
doaj +1 more source
Drawing Graphs with GLEE [PDF]
, 2008 This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.
Lev Nachmanson +2 more
openaire +2 more sources