GD
2005
Springer
14 years 5 months ago
2005
Springer
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
GD
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
GD
2005
Springer
14 years 5 months ago
2005
Springer
A workshop on Network Analysis and Visualisation was held on September 11, 2005 in Limerick Ireland, in conjunction with 2005 Graph Drawing conference. This report review the backg...
GD
2005
Springer
14 years 5 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
GD
2005
Springer
14 years 5 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
GD
2005
Springer
14 years 5 months ago
2005
Springer
Dynamic processes frequently occur in many applications. Visualizations of dynamically evolving data, for example as part of the data analysis, are typically restricted to a cumula...
GD
2005
Springer
14 years 5 months ago
2005
Springer
GD
2005
Springer
14 years 5 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
2005
Springer
14 years 5 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
GD
2005
Springer
14 years 5 months ago
2005
Springer
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...