Geometric problems defined by constraints can be represented by geometric constraint graphs whose nodes are geometric elements and whose arcs represent geometric constraints. Reduction and decomposition are techniques commonly used to analyze geometric constraint graphs in geometric constraint solvi
A formalization of geometric constraint systems and their decomposition
β Scribed by Pascal Mathis; Simon E. B. Thierry
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 534 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0934-5043
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in
This paper reports a geometric constraint-solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equations and give complete methods of deciding whether the constraints are independent and whether a constraint system is over-constra
The book Solving Geometric Constraint Systems: A Case Study in Kinematics by Glenn Kramer describes research in automating the analysis of mechanisms. The purpose of mechanism analysis is to answer qualitative and quantitative questions about the workings of complex mechanisms, such as gearboxes, ro
Geometric constraints are at the heart of parametric and feature-based CAD systems. Changing values of geometric constraint parameters is one of the most common operations in such systems. However, because allowable parameter values are not known to the user beforehand, this is often a trial-and-err