17 search results - page 3 / 4 » Straight-line grid drawings of planar graphs with linear are... |
ALGORITHMICA
2002
13 years 5 months ago
2002
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
PPL
2000
13 years 5 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 ...
GD
1999
Springer
13 years 10 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...
ESA
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
COMPGEOM
1996
ACM
13 years 10 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...