Unified Synthesis Of Contracted Graphsand Topologicalgraphs Of Planar Kinematic Chainsand Computer Software Realization

The structural type synthesis is the basic of original innovation of creative mechanism design which not only can optimize and correct various types of existing mechanisms, but also more importantly can create and invent new ones. The purpose of mechanism design is to realize expected mechanism functions by creating and inventing new mechanism which has favorable operating value and industrial quality. The contracted graphs and topological graphs have different advantage to express the structure of mechanism. It has theoretical and practical significance to construct unified mathematical model and synthesize corresponding contracted graphs and topological graphs without the rigid sub-chain and isomorphism structure by software.Firstly, this paper introduces the related conceptions of contracted graphs and topological graphs of planar kinematic chain, sketching the definition of isomorphism and sub-chain and the basic knowledge about edge_loop, then giving the array set to getting the contracted graphs and the algorithm to solve it. The theory of isomorphism identification that is improved also is successfully suitable for contracted graphs. We could generate canonical adjacency matrix set through solving the array set and applying new isomorphism discriminant theory. Thereby perimeter contracted graphs are obtained by canonical adjacency matrix.Based on the contracted graph, a unique structural synthesis method is presented for synthesizing topological graphs by inserting links with two vertex degrees. By this way, all possible topological graphs are synthesized if the amount of links and freedom is giving. In this paper, the rigid sub-chain detection and isomorphism identification is modified, so the efficiency is improved greatly.Using the Visual C++6.0 made by microsoft company and the above improved method, a programme which is suitable for computer is accomplished. With this software, the contracted graph and the topological graphs could be synthesized according to the inputting links and degree of freedom. The author of this article has finished the contracted graphs with the less than 18 links and any degree of freedom or the less than 20 links and part degree of freedom and has finished the topological graph with the less than 15 links and any degree of freedom or the less than 18 links successfully.