Open AccessA Static Layout Algorithm for DiaMeta
Author(s) -
Sonja Maier,
Mark Minas
Publication year - 2024
Publication title -
technische universität berlin – universitätsbibliothek
Language(s) - English
DOI - 10.14279/tuj.eceasst.10.147
Subject(s) - computer science , generator (circuit theory) , graph , constraint (computer aided design) , algorithm , constraint satisfaction , graph layout , theoretical computer science , programming language , diagram , graph drawing , artificial intelligence , database , probabilistic logic , mechanical engineering , power (physics) , engineering , quantum mechanics , physics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom