Generating Perimeter-magic Polygons

The C++ program perimMagicPoly constructs and counts perimeter-magic polygons for a given number of polygonal sides and given number of integer elements on each side, requiring that the sum of the elements of each of the sides is the same. 

Various symmetry-related further requirements are supported: (i) do the integers need to be distinct? (ii) do rotations along the polygonal axis or mirrors along symmetry lines through the polygon centers establish the same or different solutions? (iii) to the integers need to be a set of consecutive numbers starting at 1?