Tiling Algebra for Constraint-based Layout Editing

Clemens Zeidler, Gerald Weber, Alexander Gavruskin, Christof Lutteroth

Research output: Contribution to journalArticle

71 Downloads (Pure)

Abstract

The constraint-based layout model is a very powerful model to describe a wide range of graphical user interface (GUI) layouts, based on linear constraints. However, the advantages of the constraint-based layout model come at a price: layout designers have to ensure layouts are sound, i.e., they are solvable and items in the layout do not overlap each other. Keeping a layout sound is non-trivial since editing one constraint may have undesirable effects on other constraints.

In this article, we propose a new formalism for constraint-basedlayouts which we call a tiling algebra. Editing operations on layouts are specified algebraically, which guarantees that these operations keep a layout sound. We propose to model tiling operations with two operators that are isomorphic cancellative semigroup operators with involution if seen as binary operators. While these semigroup operators alone already cover an interesting subset of layouts, called fragments, we show that there are more involved layouts, such as the pinwheel layout, which cannot be modelled with these operators alone. For this reason we introduce a third operator which is isomorphic to a Boolean conjunction.

Our approach helps to describe constraint-based layoutscorrectly and to make layout editing robust. We apply the proposed algebra to two real constraint-basedsystems, which illustrate how it can be used to support sound layout creation and modification.
Original languageEnglish
Pages (from-to)67-94
JournalJournal of Logical and Algebraic Methods in Programming
Volume89
Early online date7 Mar 2017
DOIs
Publication statusPublished - Jun 2017

Fingerprint

Tiling
Algebra
Layout
Acoustic waves
Graphical user interfaces
Operator Semigroups
Operator
Isomorphic
Graphical User Interface
Linear Constraints
Model
Involution
Overlap
Fragment

Cite this

Tiling Algebra for Constraint-based Layout Editing. / Zeidler, Clemens; Weber, Gerald; Gavruskin, Alexander; Lutteroth, Christof.

In: Journal of Logical and Algebraic Methods in Programming, Vol. 89, 06.2017, p. 67-94.

Research output: Contribution to journalArticle

Zeidler, Clemens ; Weber, Gerald ; Gavruskin, Alexander ; Lutteroth, Christof. / Tiling Algebra for Constraint-based Layout Editing. In: Journal of Logical and Algebraic Methods in Programming. 2017 ; Vol. 89. pp. 67-94.
@article{6105c9ff60cc46a3b4f8485f378ec7c1,
title = "Tiling Algebra for Constraint-based Layout Editing",
abstract = "The constraint-based layout model is a very powerful model to describe a wide range of graphical user interface (GUI) layouts, based on linear constraints. However, the advantages of the constraint-based layout model come at a price: layout designers have to ensure layouts are sound, i.e., they are solvable and items in the layout do not overlap each other. Keeping a layout sound is non-trivial since editing one constraint may have undesirable effects on other constraints.In this article, we propose a new formalism for constraint-basedlayouts which we call a tiling algebra. Editing operations on layouts are specified algebraically, which guarantees that these operations keep a layout sound. We propose to model tiling operations with two operators that are isomorphic cancellative semigroup operators with involution if seen as binary operators. While these semigroup operators alone already cover an interesting subset of layouts, called fragments, we show that there are more involved layouts, such as the pinwheel layout, which cannot be modelled with these operators alone. For this reason we introduce a third operator which is isomorphic to a Boolean conjunction.Our approach helps to describe constraint-based layoutscorrectly and to make layout editing robust. We apply the proposed algebra to two real constraint-basedsystems, which illustrate how it can be used to support sound layout creation and modification.",
author = "Clemens Zeidler and Gerald Weber and Alexander Gavruskin and Christof Lutteroth",
year = "2017",
month = "6",
doi = "10.1016/j.jlamp.2017.01.004",
language = "English",
volume = "89",
pages = "67--94",
journal = "Journal of Logical and Algebraic Methods in Programming",
issn = "2352-2208",
publisher = "Elsevier",

}

TY - JOUR

T1 - Tiling Algebra for Constraint-based Layout Editing

AU - Zeidler, Clemens

AU - Weber, Gerald

AU - Gavruskin, Alexander

AU - Lutteroth, Christof

PY - 2017/6

Y1 - 2017/6

N2 - The constraint-based layout model is a very powerful model to describe a wide range of graphical user interface (GUI) layouts, based on linear constraints. However, the advantages of the constraint-based layout model come at a price: layout designers have to ensure layouts are sound, i.e., they are solvable and items in the layout do not overlap each other. Keeping a layout sound is non-trivial since editing one constraint may have undesirable effects on other constraints.In this article, we propose a new formalism for constraint-basedlayouts which we call a tiling algebra. Editing operations on layouts are specified algebraically, which guarantees that these operations keep a layout sound. We propose to model tiling operations with two operators that are isomorphic cancellative semigroup operators with involution if seen as binary operators. While these semigroup operators alone already cover an interesting subset of layouts, called fragments, we show that there are more involved layouts, such as the pinwheel layout, which cannot be modelled with these operators alone. For this reason we introduce a third operator which is isomorphic to a Boolean conjunction.Our approach helps to describe constraint-based layoutscorrectly and to make layout editing robust. We apply the proposed algebra to two real constraint-basedsystems, which illustrate how it can be used to support sound layout creation and modification.

AB - The constraint-based layout model is a very powerful model to describe a wide range of graphical user interface (GUI) layouts, based on linear constraints. However, the advantages of the constraint-based layout model come at a price: layout designers have to ensure layouts are sound, i.e., they are solvable and items in the layout do not overlap each other. Keeping a layout sound is non-trivial since editing one constraint may have undesirable effects on other constraints.In this article, we propose a new formalism for constraint-basedlayouts which we call a tiling algebra. Editing operations on layouts are specified algebraically, which guarantees that these operations keep a layout sound. We propose to model tiling operations with two operators that are isomorphic cancellative semigroup operators with involution if seen as binary operators. While these semigroup operators alone already cover an interesting subset of layouts, called fragments, we show that there are more involved layouts, such as the pinwheel layout, which cannot be modelled with these operators alone. For this reason we introduce a third operator which is isomorphic to a Boolean conjunction.Our approach helps to describe constraint-based layoutscorrectly and to make layout editing robust. We apply the proposed algebra to two real constraint-basedsystems, which illustrate how it can be used to support sound layout creation and modification.

UR - https://doi.org/10.1016/j.jlamp.2017.01.004

U2 - 10.1016/j.jlamp.2017.01.004

DO - 10.1016/j.jlamp.2017.01.004

M3 - Article

VL - 89

SP - 67

EP - 94

JO - Journal of Logical and Algebraic Methods in Programming

JF - Journal of Logical and Algebraic Methods in Programming

SN - 2352-2208

ER -