Sciweavers

Share
GD
2004
Springer

A Note on the Self-similarity of Some Orthogonal Drawings

10 years 6 months ago
A Note on the Self-similarity of Some Orthogonal Drawings
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-size graphs, yield selfsimilar patterns when launched on huge graphs. To prove this, we consider the problem of assessing the self-similarity of graph drawings, and measure the box-counting dimension of the output of three algorithms, each using a different approach for producing orthogonal grid drawings with a reduced number of bends.
Maurizio Patrignani
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where GD
Authors Maurizio Patrignani
Comments (0)
books