Constructible Approximations of Regular Polygons

From MaRDI portal





Let \(P\) be an arbitrary \(n\)-gon inscribed in a circle \({\mathcal C}\). The authors describe a simple algorithm which produces a sequence \((P_t)_{t\in {\mathbb N}}\) of \(n\)-gons inscribed in \({\mathcal C}\) and converging to a regular \(n\)-gon \(P(n)\). The transition from \(P_t\) to \(P_{t+1}\) is accomplished by successively adjusting the \(n\) vertices of \(P_t\) in a constructible and elementary manner. Fixing one vertex, one can identify \(P_t\) with its \(n\) vectors of arc lengths. Then the rate of convergence of \(P_t\to P(n)\) as \(t\to \infty\) can be analysed by means of properties of the associated doubly stochastic transition matrix \(M(n)\), for which \(P_{t+1}=M(n)P_t\) for all \(t\in {\mathbb N}\).











This page was built for publication: Constructible Approximations of Regular Polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757432)