Solving geometric constraint systems

  • Authors:
  • Glenn A. Kramer

  • Affiliations:
  • School of Cognitive and Computing Sciences, University of Sussex, Brighton, England and Schlumberger Laboratory for Computer Science, Austin, Texas

  • Venue:
  • AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Finding the configurations of a set of rigid bodies that satisfy a set of geometric constraints is a problem traditionally solved by reformulating the geometry and constraints as algebraic equations which are solved symbolically or numerically. But many such problems can be solved by rea soning symbolically about the geometric bodies themselves using a new technique called degrees of freedom analysis. In this approach, a sequence of actions is devised to satisfy each constraint incrementally, thus monotonically decreasing the system's remaining degrees of freedom. This sequence of actions is used metaphorically to solve, in a maximally decoupled form, the equations resulting from an algebraic representation of the problem. Degrees of freedom analysis has significant computational advantages over conventional algebraic approaches. The utility of the technique is demonstrated with a program that assembles and kinematically simulates mechanical linkages.