This page is part of an archival collection and is no longer actively maintained.

It may contain outdated information and may not meet current or future WCAG accessibility standards. We provide this content, its subpages, and associated links for historical reference only. If you need assistance, please contact support@cs.washington.edu

The Indigo Algorithm

The Indigo Algorithm

Authors: Alan Borning, Richard Anderson, and Bjorn Freeman-Benson

Published as UW Tech Report 96-05-01.

Abstract

Inequality constraints are useful for specifying various aspects of user interfaces, such as constraints that one window is to the left of another, or that an object is contained within a rectangle. However, current local propagation constraint solvers can't handle inequality constraints. We present Indigo, an efficient local propagation algorithm for satisfying acyclic constraint hierarchies, including inequality constraints.

full tech report (compressed postscript)

Constraints home page