In brief, our algorithm works as follows. The … [for interactive graphics] is converted into a normal form, hierarchical normal form. In … variable v and a constant b; all other … any collection of linear equality and inequality constraints … for the variables, given the required constraints. … the last variable eliminated … has the strongest preferential constraint [and back propagation solves the remaining variables]. … we compile [Fourier] code that can repeatedly find … This allows us to compile efficient, straight-line code … . [It] requires no runtime support for constraint … [p. 503] For these examples the Fourier code is … [p. 504] [The same method may be used for] Boolean constraints, unit two variable pre …
Google-1
Google-2
Copyright clearance needed for quotation.