Sciweavers

852 search results - page 6 / 171
» Using graph parsing for automatic graph drawing
Sort
View
GD
1998
Springer
13 years 11 months ago
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
David R. Wood
SOFSEM
2005
Springer
14 years 24 days ago
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
Radoslav Fulek, Hongmei He, Ondrej Sýkora, ...
GD
2001
Springer
13 years 11 months ago
Orthogonal Drawings with Few Layers
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
Therese C. Biedl, John R. Johansen, Thomas C. Sher...
HCI
2007
13 years 8 months ago
Anchored Maps: Visualization Techniques for Drawing Bipartite Graphs
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipar...
Kazuo Misue
GD
2000
Springer
13 years 11 months ago
GraphXML - An XML-Based Graph Description Format
GraphXML is a graph description language in XML that can be used as an interchange format for graph drawing and visualization packages. The generality and rich features of XML mak...
Ivan Herman, M. Scott Marshall