15 search results - page 3 / 3 » gd 2001 |
GD
2001
Springer
14 years 3 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
GD
2001
Springer
14 years 3 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
GD
2001
Springer
14 years 3 months ago
2001
Springer
We prove that every tree T = (V, E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f: V → R2 suc...
GD
2005
Springer
14 years 4 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
GD
2001
Springer
14 years 3 months ago
2001
Springer
The origins of chart graphics (e.g., bar charts and line charts) are well known, with the seminal event being the publication of William Playfair´s (1759-1823) ¨The Commercial a...