Theoretical Foundations of Geometric Constraint Solving
In this tour, we present the underlying theory of geometric constraint solving, using the following outline as the presentation order.
Introduction
Example of an Application of Constraint Solving
Basic Approaches to Constraint Solving
Numerical Algebraic
Propagation Methods
Symbolic Algebraic
Logical Inference and Term Rewriting
Graph-Based
A Graph-Based Two-Dimensional Constraint Solver
Allowable Geometries and Constraints
Initial Cluster Formation
Cluster Merging
Basic Construction Steps
Graph Transformations
Efficiency Considerations
Correctness of the Algorithm
Geometric Uniqueness
The icon to use to follow the prearranged order for this tour is: