In this paper, we present modifications which reduce the logarithmic s
pace requirements of an existing fractal line drawing algorithm to a c
onstant 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. Furtherm
ore, a detailed error analysis of these algorithms is given.