Drawing trees in a streaming model

• Verfasst von: Binucci, Carla [VerfasserIn]
• Verfasst von: Zweig, Katharina A. [VerfasserIn]
• Titel: Drawing trees in a streaming model
• Verf.angabe: Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Zweig
• Umfang: 5 S.
• Fussnoten: Gesehen am 10.08.2018
• Titel Quelle: Enthalten in: Information processing letters
• Jahr Quelle: 2012
• Band/Heft Quelle: 112(2012), 11, S. 418-422
• ISSN Quelle: 1872-6119
• DOI: doi:10.1016/j.ipl.2012.02.011
• Datenträger: Online-Ressource
• Sprache: eng
• K10plus-PPN: 1578464153

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.