Improved recursive bisection line drawing algorithms

In this paper, we present modifications which reduce the logarithmic space requirements of an existing fractal line drawing algorithm to a constant while increasing its speed. The resulting algorithm is faster than many existing line drawing algorithms, especially when the lines being drawn are at or near horizontal, diagonal and vertical. Furthermore, a detailed error analysis of these algorithms is given.