Layout algorithms of graph-like diagrams for GRADE windows graphic editors

  • Paulis Ķikusts
  • Pēteris Ručevskis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1027)

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.

References

  1. 1.
    GRADE V1.0: Modeling and Development Environment for GRAPES-86 and GRAPES/ 4GL, User Guide. — Siemens Nixdorf, 1993.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.MathSciNetGoogle Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    A.Papakostas, I.G.Tollis. Issues in interactive orthogonal graph drawing, — Proc. Graph Drawing '95, in Lecture Notes in Computer Science, this volume.Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Paulis Ķikusts
    • 1
  • Pēteris Ručevskis
    • 1
  1. 1.Institute of Mathematics and Computer ScienceUniversity of LatviaRigaLatvia

Personalised recommendations