On Fri, May 17, 2002 at 12:52:27 +0100, mike rawes wrote: > > How efficient are these techniques? > > At the moment, not very:
That's pretty much what I do, except I dont use a tree, I use a large vector (so there are no duplicates) and a lookup table. With gcc, linear interp it takes about 20 PIII cycles per sample, cubic takes about 50. I should use a faster cubic algorithm though. - Steve
