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 (MM07a) 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. |
Year | Venue | Keywords |
---|---|---|
2008 | ECEASST | static layout,layout algorithm,at- tribute evaluation,constraints,graph transformation,dynamic layout |
Field | DocType | Volume |
Constraint satisfaction,Graph,Programming language,Computer science,State diagram,Algorithm,Diagram,Theoretical computer science | Journal | 10 |
Citations | PageRank | References |
3 | 0.43 | 11 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sonja Maier | 1 | 71 | 10.25 |
Mark Minas | 2 | 178 | 22.34 |