Sciweavers

109 search results - page 5 / 22
» Straight-Line Drawing Algorithms for Hierarchical Graphs and...
Sort
View
GD
1997
Springer
13 years 11 months ago
Area Requirements for Drawing Hierarchically Planar Graphs
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
Xuemin Lin, Peter Eades
JGAA
1998
70views more  JGAA 1998»
13 years 7 months ago
Algorithms for Cluster Busting in Anchored Graph Drawing
Kelly A. Lyons, Henk Meijer, David Rappaport
JGAA
2007
87views more  JGAA 2007»
13 years 7 months ago
A 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
GD
2005
Springer
14 years 1 months ago
Hierarchical Layouts of Directed Graphs in Three Dimensions
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...
Seok-Hee Hong, Nikola S. Nikolov
CHI
2010
ACM
14 years 2 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon