You can probably optimise this a bit further -- by precomputing
( 3 ) * t^i * (1-t)^(3-i) for say twenty values of t and i = 0,1,2,3, the
( i )
calculations would reduce to 8 multiplications and 6 additions for each
point. All this would require would be a table of about 80 constants.
James.
--
Email: [EMAIL PROTECTED]
WWW: http://www.daa.com.au/~james/
On Tue, 26 Oct 1999, James Henstridge wrote:
> points (say 10 or 20), and calculate them. By precomputing the powers of
> the various values of t, to calculate each point you would only need 24
> multiplications and 6 additions. Also, the process is constant time
> rather than a recursive algorithm. This is potentially not as high a
> quality, but may be sufficient for on screen display.
