Geometric constraint solving

Geometric constraint solving is <a href="/facts/Constraint_satisfaction/PXI74p1T">constraint satisfaction</a> in a <a href="/facts/Computational_geometry/eeaotQtl">computational geometry</a> setting, which has primary applications in <a href="/facts/Computer_aided_design/5gSXrmmN">computer aided design</a>. A problem to be solved consists of a given set of geometric elements and a description of geometric <a href="/facts/Constraint_(computer-aided_design)/Vdk4lSnJ">constraints</a> between the elements, which could be non-parametric (tangency, horizontality, coaxiality, etc) or parametric (like distance, angle, radius). The goal is to find the positions of geometric elements in 2D or 3D space that satisfy the given constraints, which is done by dedicated software components called geometric constraint solvers.
Geometric constraint solving became an integral part of CAD systems in the 80s, when Pro/Engineer first introduced a novel concept of feature-based parametric modeling concept.
There are additional problems of geometric constraint solving that are related to sets of geometric elements and constraints: dynamic moving of given elements keeping all constraints satisfied, detection of over- and under-constrained sets and subsets, auto-constraining of under-constrained problems, etc.

Geometric constraint solving open-in-new

Geometric constraint solving