5 search results - page 1 / 1 » Lower bounds and parallel algorithms for planar orthogonal g... |
SPDP
1991
IEEE
14 years 2 months ago
1991
IEEE
PPL
2000
13 years 10 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 ...
ISAAC
2005
Springer
14 years 4 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...
GD
1997
Springer
14 years 3 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
GD
1999
Springer
14 years 3 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...