On Wed, 4 Nov 1998, Ben Stragnell wrote:

> Peter L. Peres wrote:
>
> >   My idea is, that since the Bresenham circle algorythm exists, it is
> > possible to compute the 'next' value for a phase continuous sine wave
> > without storing any table and by obtaining results directly in integers
> > (no floats no lookups no nothing).
>
> Ok... Bresenham will get you the appropriate X coordinate for iterative
> steps in Y (or vice versa), but then all you have is a pair of
> coordinates. How are you going to convert those into sines? If I

The coordinates (one of them) IS the sine corrsponding to that cosine, and
vice versa. I suppose that one could turn the algorythm a little bit to
yield a true sine or cosine, or, use the ellipsis algorythm (by Bresenham)
to approximate the sine using a linear increment. Remains to be seen how
accurate this can be made.

> Do you mean you're going to represent a sine wave as a sequence of quarter
> circles?! Hmmmm... perhaps I'm missing something?

For now, no. But I'll try to elaborate ;) It looks like a good idea,
though. Something might come from it.

Peter