Sciweavers

GD
1998
Springer
14 years 3 months ago
A Library of Algorithms for Graph Drawing
Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer,...
GD
1998
Springer
14 years 3 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
GD
1998
Springer
14 years 3 months ago
Elastic Labels on the Perimeter of a Rectangle
Claudia Iturriaga, Anna Lubiw
GD
1998
Springer
14 years 3 months ago
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang...
GD
1998
Springer
14 years 3 months ago
A Framework for Drawing Planar Graphs with Curves and Polylines
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
Michael T. Goodrich, Christopher G. Wagner
GD
1998
Springer
14 years 3 months ago
Algorithmic Patterns for Orthogonal Graph Drawing
Abstract. In this paper, we present an object-oriented design and implementation of the core steps of the giotto algorithm for orthogonal graph drawing. Our design is motivated by ...
Natasha Gelfand, Roberto Tamassia
GD
1998
Springer
14 years 3 months ago
Improved Force-Directed Layouts
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
Emden R. Gansner, Stephen C. North
GD
1998
Springer
14 years 3 months ago
Geometric Thickness of Complete Graphs
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
Michael B. Dillencourt, David Eppstein, Daniel S. ...
GD
1998
Springer
14 years 3 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
GD
1998
Springer
14 years 3 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner