3 ms·
I'm sure they exist, so can anyone point to extensions of the concept to piecewise-Bézier curves (as opposed to piecewise linear).
by nitrogen 16y ago
I'm sure they exist, so can anyone point to extensions of the concept to piecewise-Bézier curves (as opposed to piecewise linear).
- cullenking 16y agoThis isn't directly Bezier related, but you may find some inspiration here. Talks about piecewise linear, bilinear, double linear, biquadratic, cubic, bicubic, piecewise cubic and biquintic. This is a great link and helped me conceptualize and workout bicubic interpolation. Have fun :)
- avibryant 16y agoWait, where's the link?
- cullenking 16y agoDoh! Don't know how that didn't paste in: http://www.geocomputation.org/1999/082/gc_082.htm http://www.geocomputation.org/1999/082/gc_082.htm
- mbenjaminsmith 16y agoYou're going to have to delete a lot of points or move a lot of points, so it's probably not any faster than doing a regular run through RDP and then interpolating. Interpolating is easy enough. The bottleneck (at least in the Objective-C++ implementation I have) is pow and sqrt, which are pretty hard to avoid. If you want to make it faster the best way to do it is to remove the interior points of each line segment in the polygon you're working with (before you run it through RDP). The easiest way to do that is to keep track of what direction you're extracting the points from, from whatever you've already edged (or however you're doing it) since most blob extraction algorithms return every point around the edge of each polygon. If you think about it you just need to throw away everything except for the corners. That's assuming you're working from bitmap images, which I guess is not necessarily the case. If you're working from a sparse set of points to begin with and you're not getting the performance you need you're going to have find other ways to speed it up obviously.