Streamed Graph Drawing and the File Maintenance Problem
In streamed graph drawing, a planar graph, G, is given incrementally as a data stream and a straight-line drawing of G must be updated after each new edge is released. To preserve the mental map, changes to the drawing should be minimized after each update, and Binucci et al. show that exponential area is necessary for a number of streamed graph drawings for trees if edges are not allowed to move at all. We show that a number of streamed graph drawings can, in fact, be done with polynomial area, including planar streamed graph drawings of trees, tree-maps, and outerplanar graphs, if we allow for a small number of coordinate movements after each update. Our algorithms involve an interesting connection to a classic algorithmic problem—the file maintenance problem—and we also give new algorithms for this problem in a framework where bulk memory moves are allowed.
- 5.Dietz, P., Sleator, D.: Two algorithms for maintaining order in a list. In: 19th ACM Symp. on Theory of Computing (STOC), pp. 365–372 (1987)Google Scholar
- 6.Eades, P., Lai, W., Misue, K., Sugiyama, K.: Preserving the mental map of a diagram. In: Proceedings of Compugraphics, pp. 24–33 (1991)Google Scholar
- 7.Goodrich, M.T., Pszona, P.: Cole’s parametric search technique made practical. CoRR (arXiv ePrint), abs/1308.6711 (2013)Google Scholar
- 8.Kopelowitz, T.: On-line indexing for general alphabets via predecessor queries on subsets of an ordered list. In: FOCS, pp. 283–292. IEEE Computer Society (2012)Google Scholar
- 11.Tamassia, R.: Handbook of Graph Drawing and Visualization. Discrete Mathematics and Its Applications. Chapman & Hall/CRC (2007)Google Scholar
- 12.Willard, D.E.: Good worst-case algorithms for inserting and deleting records in dense sequential files. In: ACM SIGMOD, pp. 251–260 (1986)Google Scholar