Research On Geometric Constraint Solving Based On Cluster

Computer aided design is a technique that use of computers and graphic design equipment to help designers to work. In engineering and product design, computer calculations can help designers responsible for the information storage and graphics and so on. It was widely used in the computer field, its application has become the measure of a country's level of technological modernization and an important indicator of industrial modernization. Geometric constraint solving problem is the core issue of computer-aided design. In this paper, I do a large number of summary and analysis about the present method used in geometric constraint solving, the thesis has the following main research areas.In this thesis, we do a extensive study in geometric constraint solving, also put forward some new methods for solving geometric constraints.First, analysis the existing methods of constraint solving, for the defect of CA method are not solvability preserving and MFA method can be more complicated, and produced some vertices outside the core point in the decomposition process, so we put forward the basic cluster algorithm. The algorithm use the basic cluster and framework to achieve the decomposition recombination solving. In the solving process, introduce the constraint graph simplification theory in CA and MFA, then obtained the basic cluster of constraint graph and framework. The solution process using reverse order.Second, for the defect of the previous cluster rewrite rule can only solve the rigid cluster, given the definition of the two non-rigid clusters and solution methods. The method give a classification of the cluster constraint graph, then for each class of the solution given certain rules, which can solve the constraint problem can not be decomposed into rigid clusters.Finally, examples are given in the solving process of each algorithm, and compared with other methods to demonstrate the feasibility of the new methods.