Nathan Hurst wrote:
Bob Jamison wrote:
What I would like to do, is for each candidate pair, ignore the center point and consider the path to be a single 4th degree curve. This curve would then be reduced in degree to make the 3rd degree approximation at (B).
I can't help but think that this is a solved problem with a much more elegant solution. I think bezier's are essentially bernstein polynomials, so there is undoubtably lots of work on adjusting approximations. Having said that, I haven't been able to find anything remotely helpful.
Conceptually it seems that you could replace 3 segments with 2 with a smaller error term, or 128 with 127. There may be a MDL type algorithm for it too.
Keep looking though :)
njh
Another way, I think, would be to map each curve segment to approximating line segments using the Douglas-Peucker algorithm, and then redraw the subpath of Beziers from scratch. This might work, but it just -seems- to be messier.
Yes, the proportion of deleted nodes might be adjustable, with a spinner or slider. Either by floating point percentage, or an integer scaling using Bresenham's scaling algorithm.
Bob
p.s. -- List Admin: Is it possible to add the list's address as a Reply-to: addee on outgoing messages? It would make responding to the list a bit easier.