GD
1998
Springer
13 years 12 months ago
1998
Springer
GD
1998
Springer
13 years 12 months ago
1998
Springer
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...
GD
1998
Springer
13 years 12 months ago
1998
Springer
GD
1998
Springer
13 years 12 months ago
1998
Springer
GD
1998
Springer
13 years 12 months ago
1998
Springer
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...
GD
1998
Springer
13 years 12 months ago
1998
Springer
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 ...
GD
1998
Springer
13 years 12 months ago
1998
Springer
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...
GD
1998
Springer
13 years 12 months ago
1998
Springer
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...
GD
1998
Springer
13 years 12 months ago
1998
Springer
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...
GD
1998
Springer
13 years 12 months ago
1998
Springer
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...