GD
2001
Springer
13 years 9 months ago
2001
Springer
GD
2001
Springer
13 years 9 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
13 years 9 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...
GD
2001
Springer
13 years 9 months ago
2001
Springer
GD
2001
Springer
13 years 9 months ago
2001
Springer
GD
2001
Springer
13 years 9 months ago
2001
Springer
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
GD
2001
Springer
13 years 9 months ago
2001
Springer
GD
2001
Springer
13 years 9 months ago
2001
Springer
GD
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
GD
2001
Springer
13 years 9 months ago
2001
Springer
Following a workshop on graph data formats held with the 8th Symposium on Graph Drawing (GD 2000), a task group was formed to propose a format for graphs and graph drawings that me...