131
Voted
GD
15 years 6 months ago
2004 Springer 
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin...
116
click to vote
GD
15 years 6 months ago
2004 Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
111
Voted
GD
15 years 6 months ago
2004 Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
109
Voted
GD
15 years 6 months ago
2004 Springer 
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
107
Voted
GD
15 years 6 months ago
2004 Springer
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
|
Computer Graphics