Junction of noncomposite polygons

All 3-dimensional convex regular-hedra are found, i.e., the convex polyhedra having positive curvature of each vertex and such that every face is either a regular polygon or is composed of two regular polygons. The algorithm for constructing such solids is based on calculation of the corresponding symmetry groups and gives a listing of all possible adjoins along entire faces of convex regular-hedra that cannot be cut by any plane into smaller regular-hedra.