Semi-dynamic Orthogonal Drawings of Planar Graphs
We introduce a newapproac h to orthogonal drawings of planar graphs. We define invariants that are respected by every drawing of the graph. The invariants are the embedding together with relative positions of adjacent vertices. Insertions imply only minor changes of the invariants. This preserves the users mental map. Our technique is applicable to two-connected planar graphs with vertices of arbitrary size and degree. Newv ertices and edges can be added to the graph in O(log n) time. The algorithm produces drawings with at most m+f bends, where m and f are the number of edges and faces of the graph.
- 2.U. Brandes, M. Güdemann, and D. Wagner. Fully dynamic orthogonal graph layout for interactive systems. Technical report, Universität Konstanz, 2000.Google Scholar
- 3.T.C. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In Proc. European Symposium on Algorithms (ESA’ 97), Lecture Notes in Computer Science 1284, pages 37–52. Springer, 1997.Google Scholar
- 4.F. J. Brandenburg. Designing graph drawings by layout graph grammars. In Graph Drawing (GD 94), LNCS 894, pages 416–427. Springer, 1995.Google Scholar
- 7.P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics’ 91, pages 24–33, 1991.Google Scholar
- 12.F.P. Preparata and M.I. Shamos Computational Geometry: An Introduction Springer. 1985Google Scholar