The Community for Technology Leaders
Shape Modeling and Applications, International Conference on (2003)
Seoul , Korea
May 12, 2003 to May 15, 2003
ISBN: 0-7695-1909-1
pp: 89
Xiao-Shan Gao , Chinese Academy of Sciences
Gui-Fang Zhang , Capital Normal University
ABSTRACT
A basic idea of geometric constraint solving is to divide a large geometric constraint problem into several subproblems according to certain patterns and then to merge these subproblems to obtain a solution to the original problem. In this paper, we give a classification of the basic merge patterns in 2D when solving a constraint problem with generalized construction sequences. We also obtain the analytical solutions to all eleven cases of merge patterns which is to assemble two rigid bodies connected with three constraints. We also give conditions to solve these patterns with ruler and compass constructions.
INDEX TERMS
Geometric constraint solving, parametric CAD, generalized construction sequence, basic merge pattern, assembly
CITATION
Xiao-Shan Gao, Gui-Fang Zhang, "Classification and Solving of Merge Patterns in Geometric Constraint Solving", Shape Modeling and Applications, International Conference on, vol. 00, no. , pp. 89, 2003, doi:10.1109/SMI.2003.1199605
79 ms
(Ver 3.3 (11022016))