Optimality conjecture for geometric polynomial approximation of circular arcs

Let \bfmc\bfm{c} be a circular arc and let \bfmpn\bfm{p}_n be a GkG^k geometric approximant of degree nn. Choose a polynomial p2n,kp_{2n,k}^* minimizing

p2n,k=maxt[1,1](1t2)k+1qn,k(t),\|p_{2n,k}\|=\max_{t\in[-1,1]}\left|(1-t^2)^{k+1}q_{n,k}(t)\right|,

where qn,kq_{n,k} has degree 2n2k22n-2k-2, and let \bfmbj\bfm{b}_j, j=0,1,,nj=0,1,\dots,n, be the control points determined by this choice. Optimality conjecture. The best GkG^k geometric approximant \bfmpn\bfm{p}_n of the circular arc \bfmc\bfm{c} according to the error measure ψn,k\psi_{n,k} arises from the choice p2n,kp_{2n,k}^* determining \bfmbj\bfm{b}_j, j=0,1,,nj=0,1,\dots,n, with minimal C(\bfmb0,,\bfmbn)\left|C(\bfm{b}_0,\dots,\bfm{b}_n)\right|. The conjecture would establish the proposed framework as an optimal construction for circular-arc approximation and would extend the paper's known optimal results for earlier cases while covering the proposed G0G^0 cubic and G1G^1 quartic approximants. The supplied text gives no resolution, so its status remains open.

Sources & referencesView supporting material

Primary source

Aleš Vavpetič and Emil Žagar, “A general framework for the optimal approximation of circular arcs by parametric polynomial curves”, arXiv:1711.04523 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.