GD 1998 | Sciweavers

17

GD
1998
Springer

136views Computer Graphics» more GD 1998»

13 years 11 months ago

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. ...

claim paper

Read More »

27

click to vote

GD
1998
Springer

155views Computer Graphics» more GD 1998»

Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs

13 years 11 months ago

Download www.ics.uci.edu

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 ...

claim paper

Read More »

17

click to vote

GD
1998
Springer

122views Computer Graphics» more GD 1998»

Using Graph Layout to Visualize Train Interconnection Data

13 years 11 months ago

Download kops.ub.uni-konstanz.de

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

claim paper

Read More »

16

click to vote

GD
1998
Springer

133views Computer Graphics» more GD 1998»

Ptolomaeus: The Web Cartographer

13 years 11 months ago

Download www.iis.nsk.su

Giuseppe Di Battista, Renato Lillo, Fabio Vernacot...

claim paper