92
Voted
GD
1998
Springer
15 years 3 months ago
1998
Springer
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...
99
Voted
GD
1998
Springer
15 years 3 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
75
Voted
GD
1998
Springer
15 years 3 months ago
1998
Springer
GD
1998
Springer
15 years 3 months ago
1998
Springer
129
Voted
GD
1998
Springer
15 years 3 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...
67
Voted
GD
1998
Springer
15 years 3 months ago
1998
Springer
68
Voted
GD
1998
Springer
15 years 3 months ago
1998
Springer
83
Voted
GD
1998
Springer
15 years 3 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...
96
Voted
GD
1998
Springer
15 years 3 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
15 years 3 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...