An incremental algorithm for satisfying hierarchies of multiway dataflow constraints

Abstract

One-way dataflow constraints have gained popularity in many types of interactive systems because of their simplicity, efficiency, and manageability. Although it is widely acknowledged that multiway dataflow constraints could make it easier to specify certain relationships in these applications, concerns about their predictability and efficiency have impeded their acceptance. Constraint hierarchies have been developed to address the predictability problem, and incremental algorithms have been developed to address the efficiency problem. However, existing incremental algorithms for satisfying constraint hierarchies encounter two difficulties: (1) they are incapable of guaranteeing an acyclic solution if a constraint hierarchy has one or more cyclic solutions and (2) they require worst-case exponential time to satisfy systems of multioutput constraints. This article surmounts these difficulties by presenting an incremental algorithm called QuickPlan that satisfies in worst-case O(N') time any hierarchy of multiway, multioutput dataflow constraints that has at least one acyclic solution, where N is the number of constraints. With benchmarks and real problems that can be solved efficiently using existing algorithms, its performance is competitive or superior. With benchmarks and real problems that cannot be solved using existing algorithms or that cannot be solved efficiently, QuickPlan finds solutions and does so efficiently, typically in O(N) time or less. QuickPlan is based on the strategy of propagation of degrees of freedom. The only restriction it imposes is that every constraint method must use all of the variables in the constraint as either an input or an output variable. This requirement is met in every constraint-based, interactive application that we have developed or seen.. 31 'Henceforth, the term "constraint" will mean dataflow constraint, and the term "constraint solver" will mean dataflow constraint solver.

Comparing usability of one-way and multi-way constraints for diagram editing

“…Multi-way constraint solving approaches fall into four main classes: local propagation based (e.g., [Sannella et al 1993;Freeman-Benson et al 1990;Vander Zanden 1996]); linear arithmetic solver based (e.g., [Gleicher 1993;Borning et al 1997;Marriott and Chok 2002]); geometric solver-based (e.g., [Fudos 1995;Kramer 1992]…”

Decomposition of Geometric Constraint Systems: A Survey

“…60,61,62 Several approaches in geometry directly work with the (geometric) constraint graph. 63,64,65,66 In both cases, the principle of PDOF is to iterate the following steps:…”

Constraint-based document layout for the Web

“…[21]), or local propagation algorithms for acyclic collections of multi-way constraints (e.g. [23,26]). UI systems that handle simultaneous linear equations include DETAIL [12] and Ultraviolet [4].…”