Is there some kind of Bresenham algorithm or equivalent for scanline rendering a rotated ellipse? Back in the day when you often had to write your own low level rendering algorithms we all used to learn the Bresenham algorithms for lines and circles.

It was almost trivially easy to extend the Bresenham circle algorithm to cover ellipses whose axes were parallel to the X and Y axes.

But it always eluded me if there was some Bresenham-style way to render an arbitrary ellipse whose axes were at some arbitrary angle.

Does such a scanline method for rotated ellipses exist?
The classic book Computer Graphics: Principles and Practice (second edition) by Foley, van Dam, et al. describes such an algorithm in section 19.2.

The explanation in the book seems to come from an MSc thesis, Raster Algorithms for 2D Primitives by Dilip Da Silva. 

See also these papers:


Curve-drawing algorithms for raster displays by Van Aken and Novak (ACM TOG, 1985). 
A tracking algorithm for implicitly defined curves by Chandler (IEEE Computer Graphics and Applications, 1988).