5 search results - page 1 / 1 » jgaa 1998 |
JGAA
1998
13 years 4 months ago
1998
JGAA
1998
13 years 4 months ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
JGAA
2000
13 years 4 months ago
2000
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
JGAA
2006
13 years 5 months ago
2006
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
JGAA
2000
13 years 4 months ago
2000
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 ...