Drawing trees in a streaming model

Authors:
Carla Binucci;Ulrik Brandes;Giuseppe Di Battista;Walter Didimo;Marco Gaertler;Pietro Palladino;Maurizio Patrignani;Antonios Symvonis;Katharina Zweig
Affiliations:
Dipartimento di Ing. Elettronica e dellInformazione, Universití degli Studi di Perugia, Italy;Department of Computer and Information Science, University of Konstanz, Germany;Dipartimento di Informatica e Automazione, Universití Roma Tre, Italy;Dipartimento di Ing. Elettronica e dellInformazione, Universití degli Studi di Perugia, Italy;Institute of Theoretical Computer Science, University of Karlsruhe, Germany;Dipartimento di Medicina Sperimentale e Scienze Biochimiche, Universití degli Studi di Perugia, Italy;Dipartimento di Informatica e Automazione, Universití Roma Tre, Italy;Department of Mathematics, National Technical University of Athens, Greece;Interdisciplinary Center for Scientific Computing (IWR), University of Heidelberg, Germany
Venue:
Information Processing Letters
Year:
2012

Citing 13
Cited 0

A note on optimal area algorithms for upward drawings of binary trees

Computational Geometry: Theory and Applications
A better heuristic for orthogonal graph drawings

Computational Geometry: Theory and Applications
Interactive Orthogonal Graph Drawing

IEEE Transactions on Computers
Dynamic graph drawing

Drawing graphs
Reductions in streaming algorithms, with an application to counting triangles in graphs

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
The Minimum Area of Convex Lattice n-Gons

Combinatorica
A survey of trace exploration tools and techniques

CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
On graph problems in a semi-streaming model

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Data streams: algorithms and applications

Foundations and Trends® in Theoretical Computer Science
Execution patterns in object-oriented visualization

COOTS'98 Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4
Straight-line drawings of general trees with linear area and arbitrary aspect ratio

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Drawing trees in a streaming model

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We pose a new visualization challenge, asking Graph Drawing algorithms to cope with the requirements of Streaming applications. In this model a source produces a graph one edge at a time. When an edge is produced, it is immediately drawn and its placement cannot be altered. The drawing has an image persistence, that controls the lifetime of edges. If the persistence is k, an edge remains in the drawing for the time spent by the source to generate k edges, and then it fades away. In this model we study the area requirement of planar straight-line grid drawings of trees and we assess the output quality of the presented algorithms by computing the competitive ratio with respect to the best known offline algorithms.