Elsevier

Computers & Graphics

Volume 19, Issue 6, November–December 1995, Pages 847-860
Computers & Graphics

Improved recursive bisection line drawing algorithms

https://doi.org/10.1016/0097-8493(95)00067-4Get rights and content

Abstract

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.

References (12)

There are more references available in the full text version of this article.

Cited by (0)

View full text