Let a convex polygon \(P\) be approximated by a regular polygon \(R_n\) with \(n\) sides such that the area of their symmetric difference, i.e. the region that belongs to exactly one of them, is as small as possible. The author further assumes \(R_n\) to have the same perimeter as \(P\). He does not discuss the orientation of \(R_n\) and so is left with an extremal problem whose only variable is the centre \(I\) of \(R_n\) which he calls generalized Steiner point of \(P\). He gives two methods for computing the area of the symmetric difference and approximates the optimal position for an octagon and for a hexagon by computer in a few seconds.