25 search results - page 1 / 5 » Algorithmic Patterns for Orthogonal Graph Drawing |
GD
1998
Springer
13 years 9 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
2004
Springer
13 years 10 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
DAM
2000
13 years 4 months ago
2000
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
PPL
2000
13 years 4 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...