Solving disjunctive constraints for interactive graphical applications (2001)
Cached
Download Links
- [www.cs.washington.edu]
- [www.cs.mu.oz.au]
- DBLP
Other Repositories/Bibliography
| Venue: | In 7th Intl. Conf. on Principles and Practice of Constraint Programming - CP2001, number 2239 in LNCS |
| Citations: | 8 - 3 self |
BibTeX
@INPROCEEDINGS{Marriott01solvingdisjunctive,
author = {Kim Marriott and Peter Moulder and Peter J. Stuckey and Alan Borning},
title = {Solving disjunctive constraints for interactive graphical applications},
booktitle = {In 7th Intl. Conf. on Principles and Practice of Constraint Programming - CP2001, number 2239 in LNCS},
year = {2001},
pages = {361--376},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortunately, disjunctions are typically not handled by constraint solvers that support direct manipulation, in part because solving such problems is NP-hard. We show here that is in fact possible to (re-)solve systems of disjunctive constraints representing non-overlap constraints sufficiently fast to support direct manipulation in interactive graphical applications. The key insight behind our algorithms is that the disjuncts in a non-overlap constraint are not disjoint: during direct manipulation we need only move between disjuncts that are adjacent in the sense that they share the current solution. We give both a generic algorithm, and a version specialised for linear arithmetic constraints that makes use of the Cassowary constraint solving algorithm. 1
