2001
DOI: 10.1145/504704.504705
|View full text |Cite
|
Sign up to set email alerts
|

The Cassowary linear arithmetic constraint solving algorithm

Abstract: Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring that a pane occupy the leftmost third of a window, or preferring that an object be contained within a rectangle if possible. Previous constraint solvers designed for user interface applications cannot handle simultaneous linear equations and inequalities efficiently. This is a major limitation, as such systems of constraints arise often… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
128
0
1

Year Published

2001
2001
2012
2012

Publication Types

Select...
3
3
3

Relationship

1
8

Authors

Journals

citations
Cited by 144 publications
(129 citation statements)
references
References 14 publications
0
128
0
1
Order By: Relevance
“…The BalanceManager uses the Cassowary constraint solver [1] to maintain spatial constraints on the layout. We have currently implemented constraints preventing Box objects from being pushed outside the bounds of the managed area, as well as preventing objects from overlapping one another.…”
Section: Methodsmentioning
confidence: 99%
“…The BalanceManager uses the Cassowary constraint solver [1] to maintain spatial constraints on the layout. We have currently implemented constraints preventing Box objects from being pushed outside the bounds of the managed area, as well as preventing objects from overlapping one another.…”
Section: Methodsmentioning
confidence: 99%
“…The current implementation employs a Java implementation of the Cassowary constraint solving algorithm [3,9,27]. This solver supports arbitrary linear arithmetic constraints (both equalities and inequalities over real-valued variables).…”
Section: Methodsmentioning
confidence: 99%
“…This will ensure that the solutions are sorted from the closest specification to the farthest from the original. Finally, we call the constraints solver (cassowary [2]) for the consistency verification and the calculation of the solution for each specification in the order defined by the sort. The first verification that gives a consistency stops the process and the adapted document is generated.…”
Section: Adaptation Algorithmmentioning
confidence: 99%