Linear-time geometric algorithm for evaluating B\'ezier curves
Numerical Analysis
2019-06-20 v4 Graphics
Abstract
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational complexity is linear with respect to the number of control points and its memory complexity is . Some remarks on similar methods for surfaces in rectangular and triangular B\'{e}zier form are also given.
Cite
@article{arxiv.1803.06843,
title = {Linear-time geometric algorithm for evaluating B\'ezier curves},
author = {Filip Chudy and Paweł Woźny},
journal= {arXiv preprint arXiv:1803.06843},
year = {2019}
}