Re: Pulse Gen

Jon E wrote:

>But, the Bresenham algorithm(s) are specifically optimized for a
>discrete grid, and want to pass through every point along one axis
>in the path.<snip>, but really doesn't apply well to a machine tool
>path. In that, you may want to skip over intermediate 'pixels' at
>high speed, or spend some time 'between' them when moving very
>slowly. The Bresenham algorithms would be cumbersome for this kind
>of purpose.

Any stepper or quad encoder (digital) based CNC machine IS
a "discrete grid"!

Looking at this from the "other side": Modern computer speed allows
us to process each 'pixel' at high speed (no need to skip over); and
there is no 'between' since the least increment is the step size, or
the encoder-derived distance resolution!

>Simple trig is all you need to compute smooth paths at any velocity.

<snip>Although this works best with floating point computations, that

>is no big impediment as it once was.
>Jon

True. But it still "eats" processor time, and the 'shift-add' type
algorithms (like Bresenhams, as there ARE others) leave this time
free for other things.

Ballendo