An analysis of cubic approximation schemes for conic sections


In this paper a piece of a conic section is approximated by a cubic or piecewise cubic polynomial. The main tool is to define the two inner control points of the cubic as an affine combination, defined by λ ∈ [0, 1], of two control points of the conic. If λ is taken to depend on the weight w of the latter, a function λ(w) results which is used to distinguish between different algorithms and to analyze their properties. One of the approximations is a piecewise cubic having G continuity at the break points. §

DOI: 10.1007/BF02124751

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@article{Floater1996AnAO, title={An analysis of cubic approximation schemes for conic sections}, author={Michael S. Floater}, journal={Adv. Comput. Math.}, year={1996}, volume={5}, pages={361-379} }