Abstract
Incremental graph drawing is a model gaining more and more importance in many applications. We present algorithms that allow insertions of new vertices into an existing drawing without changing the position of the objects drawn so far. We prove bounds for the quality of our drawings and considerably improve on previous bounds. Here the number of bends and the used area are our quality measures. Besides we discuss lower bounds for this problem.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Biedl, T.C., New Lower Bounds for Orthogonal Graph Drawings, Proceedings on GD'95, Passau, 28–39, 1995.
Biedl, T.C., Orthogonal Graph Drawing, Algorithms and Lower Bounds, Diploma Thesis TU Berlin, 1995.
Batini, C., E. Nardelli and R. Tamassia, A Layout Algorithm for Data-Flow Diagrams, IEEE Trans. on Software Engineering, Vol. SE-12 (4), 538–546, 1986.
Batini, C., M. Talamo and R. Tamassia, Computer Aided Layout of EntityRelationship Diagrams, The Journal of Systems and Software, Vol. 4, 163–173, 1984.
CPLEX optimization, Inc. Using the CPLEX Base System. CPLEX Optimization, Inc., 1995.
DiBattista G., P. Eades, R. Tamassia and I.G. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, vol. 4, no 5, 235–282, 1994.
Fößmeier U., Interactive Orthogonal Graph Drawing: Algorithms and Bounds, Technical Report WSI-97-12, University of Tübingen.
Garg, A., R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Proceedings of GD'94, Princeton, 286–297, 1994.
Jahrmarkt, F., Knickminimierende Verfahren für interaktives orthogonales Graphenzeichnen, Diplomarbeit Universität Tübingen, 1997 (in German language).
Kramer M.R., J. van Leeuwen, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits, Advances in Computer Research, Vol. 2: VLSI Theory, Jai Press, Reading, MA, 129–146, 1992.
Misue, K., P. Eades, W. Lai and K. Sugiyama, Layout Adjustment and the Mental Map, Journal of Visual Languages and Computing, vol. 6, 183–210, 1995.
Papakostas, A., J. M. Six, I. G. Tollis, Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing, Proceedings on GD'96, Berkeley, 371–386, 1996.
Papakostas, A. and I.G. Tollis, Issues in Interactive Orthogonal Graph Drawing, Proceedings on GD'95, Passau, 419–430, 1995.
Papakostas, A. and I.G. Tollis, Improved Algorithms and Bounds for Orthogonal Drawings, Proceedings on GD'94, Princeton, 40–51, 1994.
Valiant, L. G., Universality considerations in VLSI circuits, IEEE Trans. Comput., C-30, 135–140, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fößmeier, U. (1997). Interactive orthogonal graph drawing: Algorithms and bounds. In: DiBattista, G. (eds) Graph Drawing. GD 1997. Lecture Notes in Computer Science, vol 1353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63938-1_55
Download citation
DOI: https://doi.org/10.1007/3-540-63938-1_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63938-1
Online ISBN: 978-3-540-69674-2
eBook Packages: Springer Book Archive