Arrow Research search

Author name cluster

Glenn A. Kramer

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

AIJ Journal 1992 Journal Article

A geometric constraint engine

  • Glenn A. Kramer

This paper describes a geometric constraint engine for finding the configurations of a collection of geometric entities that satisfy a set of geometric constraints. This task is traditionally performed by reformulating the geometry and constraints as algebraic equations which are then solved symbolically or numerically. Symbolic algebraic solution is NP-complete. Numerical solution methods are characterized by slow runtimes, numerical instabilities, and difficulty in handling redundant constraints. Many geometric constraint problems can be solved by reasoning symbolically about the geometric entities themselves using a new technique called degrees of freedom analysis. In this approach, a plan of measurements and actions is devised to satisfy each constraint incrementally, thus monotonically decreasing the system's remaining degrees of freedom. This plan is used to solve, in a maximally decoupled form, the equations resulting from an algebraic representation of the problem. Degrees of freedom analysis results in a polynomial-time, numerically stable algorithm for geometric constraint satisfaction. Empirical comparison with a state-of-the-art numerical solver in the domain of kinematic simulation shows degrees of freedom analysis to be more robust and substantially more efficient.

AAAI Conference 1990 Conference Paper

Solving Geometric Constraint Systems

  • Glenn A. Kramer

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.