Abstract
We propose a set of layout operations ensuring flexible and convenient interactive editing of communication diagrams and nested entity-relationship models having textual labels on connections. The set includes several procedures for incremental diagram layout. Tools for fully automatic layout and for direct manual painting of graphic primitives are also integrated in a single system. In this way we have filled to some extent the gap between both extremal levels of editing.
Chapter PDF
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
GRADE V1.0: Modeling and Development Environment for GRAPES-86 and GRAPES/ 4GL, User Guide. — Siemens Nixdorf, 1993.
K.Sugiyama, K.Misue. Visualization of structural information: automatic drawing of compound digraphs. — IEEE Trans. Syst. Man, Cybern., vol. 21, no. 4, 1991, pp. 876–892.
G.Di Batista, P.Eades, R.Tamassia, I.G. Tollis. Algorithms for drawing graphs: an annotated bibliography — Computational Geometry: Theory and Applications, vol. 4, no. 5, 1994, pp. 235–282.
K.Miriyala, S.W.Hornick, R.Tamassia. An incremental approach to aesthetic graph layout, — Proc. Int. Workshop on Computer-Aided Software Engineering (CASE '93), 1993.
A.Papakostas, I.G.Tollis. Issues in interactive orthogonal graph drawing, — Proc. Graph Drawing '95, in Lecture Notes in Computer Science, this volume.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ķikusts, P., Ručevskis, P. (1996). Layout algorithms of graph-like diagrams for GRADE windows graphic editors. In: Brandenburg, F.J. (eds) Graph Drawing. GD 1995. Lecture Notes in Computer Science, vol 1027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021819
Download citation
DOI: https://doi.org/10.1007/BFb0021819
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60723-6
Online ISBN: 978-3-540-49351-8
eBook Packages: Springer Book Archive