Solving linear arithmetic constraints for user interface applications
Alan H. Borning, Kim Marriott, Peter J. Stuckey et al. · ACM Symposium on User Interface Software and Technology (UIST) · 1997
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring that a pane occupy the leftmost l/3 of a window, or preferring that an object be contained within a rectangle if possible.Current constraint solvers designed for UI applications cannot efficiently handle simultaneous linear equations and inequalities.This is a major limitation.We describe incremental algorithms based on the dual simplex and active set methods that can solve such systems of constraints efficiently.
Cited by 109 works. doi:10.1145/263407.263518 Open-access PDF
Authors
References
- Savitzky-Golay Smoothing Filters
- Numerical recipes in C: the art of scientific computing
- Numerical Recipes, The Art of Scientific Computing
- Practical Methods of Optimization
- Sketchpad
- Practical methods of optimization
- Practical Methods of Optimization.
- Sketch pad a man-machine graphical communication system
- Sketchpad a Man-Machine Graphical Communication System
- Fast contact force computation for nonpenetrating rigid bodies