Tiling algebra for constraint-based layout editing
METADATA ONLY
Loading...
Author / Creator
Date
2017-06
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
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-based layouts 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 modeled 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 layouts correctly and to make layout editing robust. We apply the proposed algebra to two real constraint-based systems, which illustrate how it can be used to support sound layout creation and modification.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING
Volume
89
Pages / Article No.
67 - 94
Publisher
Elsevier
Event
Edition / version
Methods
Geographic location
Date collected
Date created
Subject
GUI layout; Layout editing; Constraint-based layout model; Sound layouts; Algebra