Concerning classification of parquet polygons

Convex regularhedra were classified a few years ago. The problem of description of convex polyhedra with parquet faces still remains open. The hypothesis of Yu. Pryakhin (1974) on the possible types of parquet polygons is confirmed in the article. The types of parquet polygons are found in the form of solving a system of equations. It is found out for which types of parquet polygons there is no the right line dividing one parquet polygon into two. The computer programs which helped to calculate these solutions are given.