Dynamic approximation of complex graphical constraints by linear constraints

@inproceedings{Hurst2002DynamicAO,
  title={Dynamic approximation of complex graphical constraints by linear constraints},
  author={Nathan Hurst and Kim Marriott and Peter Moulder},
  booktitle={UIST},
  year={2002}
}
Current constraint solving techniques for interactive graphical applications cannot satisfactorily handle constraints such as non-overlap, or containment within non-convex shapes or shapes with smooth edges. We present a generic new technique for efficiently handling such kinds of constraints based on trust regions and linear arithmetic constraint solving. Our approach is to model these more complex constraints by a dynamically changing conjunction of linear constraints. At each stage, these… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…