Dot diffusion was reinvented 14 years later by Arney, Anderson and Ganawan
-without crediting Knuth. They call their method **omni-directional error
-diffusion**. Instead of using a clustered dot matrix like dot diffusion,
-they use a dispersed dot matrix. This is a 16×12 portion of that matrix:

@@ -379,5 +380,5 @@

-The recommended implementation of omni-directional error diffusion uses +

The preferred implementation of omni-directional error diffusion uses a slightly different propagation matrix, where top and bottom neighbours get more error than the others:

@@ -395,8 +396,12 @@ Small error diffusion matrices usually cause artifacts to appear because
-the error is not propagated in enough directions. Ostromoukhov suggest error
-diffusion values that vary according to the input value. The list of 256
-discrete value triplets for *d1*, *d2* and *d3* he provides
-give pretty good results with serpentine parsing:

Ostromoukhov suggests error diffusion values that vary according to the
+input value. The list of 256 discrete value triplets for *d1*, *d2*
+and *d3* he provides give pretty good results with serpentine parsing:
+