[Numpy-discussion] On Topic: Faster way to implement Bernstein polys: explicit or recursion?
David Goldsmith
d.l.goldsmith at gmail.com
Wed Oct 16 21:56:54 EDT 2013
Many thanks to Daniele Nicolodi for pointing me to the Wikipedia article
on Bézier curves. Said article gives two formulae for the Bézier curve of
degree n: one explicit, one recursive. Using numpy.polynomial.Polynomial
as the base class, and its evaluation method for the evaluation in each
dimension, which approach is likely to be faster for evaluation at
parameter t? Does it depend on the degree, i.e., one approach will likely
be faster for low degree while the other will likely be faster for higher
degree? Thanks!
DG
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/numpy-discussion/attachments/20131016/94b736b6/attachment.html>
More information about the NumPy-Discussion
mailing list