BASIS FOR COMPUTER GENERATION OF THE DRAWINGS OF MACHINE PARTS. (PART 1. TOPOLOGICAL GENERATING RULES OF CONVEX POLYHEDRA CORRESPONDING TO DUAL GRAPHS HAVING HAMILTONIAN CYCLES).

A topological method of generating convex polyhedra is presented. As an instruction from man the edge-vertex table (k, lambda //k vertical k equals 3,4,. . . ,r, where k: number of edges gathering into a vertex, lambda //k: number of k-edged vertex) is proposed. When the machine receives the edge-vertex table, it generates all of the mutually different linear dual graphs on convex polyhedra, where the graphs have Hamiltonian cycles. The funamental theory for the above process is contained.