Optimality conjecture for geometric polynomial approximation of circular arcs
Optimality conjecture for geometric polynomial approximation of circular arcs
Let be a circular arc and let be a geometric approximant of degree . Choose a polynomial minimizing
where has degree , and let , , be the control points determined by this choice. Optimality conjecture. The best geometric approximant of the circular arc according to the error measure arises from the choice determining , , with minimal . 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 cubic and 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.