New computer methods for global optimization
New computer methods for global optimization
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
Combining constructive and equational geometric constraint-solving techniques
ACM Transactions on Graphics (TOG)
Symbolic and numerical techniques for constraint solving
Symbolic and numerical techniques for constraint solving
Solving spatial basic geometric constraint configurations with locus intersection
Proceedings of the seventh ACM symposium on Solid modeling and applications
Using Cayley-Menger determinants for geometric constraint solving
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
A constraint solver to define correctly dimensioned and overdimensioned parts
Computer-Aided Design
| Hi-index | 0.00 |
Many applications of geometric nature can be modeled by geometric problems defined by constraints in which the constraint parameters have interval uncertainty. In a previous work, we developed a method for solving geometric constraint problems where parameters are narrow intervals in the domain of the geometric problem. Based on this work, we present a new approach to solve more general problems with non-trivial-width interval parameters that may not necessarily be in the domain of the problem. We show how our approach is successfully applied to a number of problems like solving geometric problems with tolerances, checking constraint feasibility and analyzing link motion of planar mechanisms.