A Static Layout Algorithm for DiaMeta

Authors

  • Sonja Maier
  • Mark Minas

DOI:

https://doi.org/10.14279/tuj.eceasst.10.147

Abstract

The diagram editor generator framework DiaMeta utilizes meta-model-based language specifications and supports free-hand as well as structured editing. In this paper we present a layouting approach that is especially well suited for a static layout. It is based on the layout algorithm presented in a previous paper that uses the two concepts constraint satisfaction and attribute evaluation. This algorithm is combined with graph transformations and the result is a natural way of describing the layout of visual languages. As an example we use a simplified version of Sugiyama's algorithm, applied to statechart diagrams.

Downloads

Published

2008-07-13