Ultraviolet: A Constraint Satisfaction Algorithm for InteractiveGraphics

  • Authors:
  • Alan Borning;Bjorn Freeman-Benson

  • Affiliations:
  • Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA 98195-2350. E-mail borning@cs.washington.edu;Object Technology International Inc., R. Buckminster Fuller Laboratory, 201 - 506 Fort St., Victoria, BC,CANADA V8W 1E6. E-mail bnfb@oti.com

  • Venue:
  • Constraints
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ultraviolet is a constraint satisfaction algorithm intendedfor use in interactive graphical applications. It is capableof solving constraints over arbitrary domains using local propagation,and inequality constraints and simultaneous linear equationsover the reals. To support this, Ultraviolet is a hybrid algorithmthat allows different subsolvers to be used for different partsof the constraint graph, depending on graph topology and kindof constraints. In addition, Ultraviolet and its subsolvers supportplan compilation, producing efficient compiled code that canbe evaluated repeatedly to resatisfy a given collection of constraintsfor different input values.