A Note on the Self-similarity of Some Orthogonal Drawings

Patrignani, Maurizio (2004) A Note on the Self-similarity of Some Orthogonal Drawings. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 389-394(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_39).

Full text not available from this repository.


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 self-similar 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. Work partially supported by European Commission – Fet Open project COSIN – COevolution and Self-organisation In dynamical Networks – IST-2001-33555, by European Commission – Fet Open project DELIS – Dynamically Evolving Large Scale Information Systems – Contract no 001907, by ldquoProgetto ALINWEB: Algoritmica per Internet e per il Webrdquo, MIUR Programmi di Ricerca Scientifica di Rilevante Interesse Nazionale, and by ldquoThe Multichannel Adaptive Information Systems (MAIS) Projectrdquo, MIUR Fondo per gli Investimenti della Ricerca di Base.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-31843-9_39
Classifications: Z Theory > Z.999 Others
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/609

Actions (login required)

View Item View Item