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
Solving geometric constraint systems. I. A global propagation approach
โ Scribed by Xiao-Shan Gao; Shang-Ching Chou
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 1010 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
โฆ Synopsis
We describe a geometric constraint solving method/system that takes the declarative description of geometric diagrams or engineering drawings as input and outputs a sequence of steps to construct the diagram with ruler and compass if it succeeds. We extend the local propagation to a global one. Like the local propagation. the global propagation tries to determine the position of a geometric object from the set of geometric objects whose positions are already known. However, our global propagation uses not only the constraints involving this object but also implicit information derived from other constraints. The algorithm can be used to build intelligent CAD and interactive computer graphic systems.
๐ SIMILAR VOLUMES
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