Let us look into the general analytical aspect of the polygon. With the help of linear and circular equations and a sequence of super position (of co-ordinates) of the matching line points each structural component may be described by algebraic equation.

The application of iterative methods for finding of appropriate values of all roots requires the knowledge of boungs of its localisation. This is solved only for the polynomial of a single variable. By applying the process of consecutive exclusion may theoretically lead to a polynomially of not higher the 12544 power of a single variable. However, the volume of required analytical transformations is boundless even for high-powercomputers. Thus for first step of transformation (from four required ones) computer must perform more than 10^11 operations, and a volume of calculations on each succeeded step, at least, in 100 times more than preceeding one. Morever, the investigation of such resulting equation requires to operate with a number representation of 4 thousand figures. These demands very far exceed the capacities of modern computers.