A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
Computer-Aided Design
| Hi-index | 0.00 |
A basic idea of geometric constraint solving is to dividea large geometric constraint problem into several subproblemsaccording to certain patterns and then to merge thesesubproblems to obtain a solution to the original problem. Inthis paper, we give a classification of the basic merge patternsin 2D when solving a constraint problem with generalizedconstruction sequences. We also obtain the analyticalsolutions to all eleven cases of merge patterns which is toassemble two rigid bodies connected with three constraints.We also give conditions to solve these patterns with rulerand compass constructions.