Editing Line drawing algorithm (section)

=== Approximate methods ===
Boyer and Bourdin introduced an approximation algorithm that colors pixels lying directly under the ideal line.<ref>Vincent Boyer, Jean-Jacques Bourdin: ''Fast Lines: a Span by Span Method.'' Computer Graphics Forum 18, 3 (1999): 377–384 ({{webarchive|url=https://www.ai.univ-paris8.fr/~jj/Gris/Articles/eg99.pdf |wayback=20070118211901 |text=PDF, 400 kB |date=23 April 2024}})</ref> A line rendered in this way exhibits some special properties that may be taken advantage of. For example, in cases like this, sections of the line are periodical. This results in an algorithm which is significantly faster than precise variants, especially for longer lines. A worsening in quality is only visible on lines with very low steepness.