Changeset 2175Tweet

Timestamp:

Dec 29, 2007, 11:35:52 PM (12 years ago)

Author:

Sam Hocevar

Message:

• A few fixes here and there.

File:

• www/study/part3.html (modified) (3 diffs)

www/study/part3.html

@@ -370 +370 @@
 
 <p> Dot diffusion was reinvented 14 years later by Arney, Anderson and Ganawan
-without crediting Knuth. They call their method <b>omni-directional error
-diffusion</b>. 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: </p>
+without even citing Knuth. They call their method <b>omni-directional error
+diffusion</b>. Instead of using a clustered dot matrix like Knuth recommends
+for dot diffusion, they use a dispersed dot matrix, which gives far better
+results on a computer display. This is a 16×12 portion of that matrix: </p>
 
 <p style="text-align: center;">
@@ -379 +380 @@
 </p>
 
-<p> The recommended implementation of omni-directional error diffusion uses
+<p> 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: </p>
@@ -395 +396 @@
 
 <p> 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 <i>d1</i>, <i>d2</i> and <i>d3</i> he provides
-give pretty good results with serpentine parsing: </p>
+the error is not propagated in enough directions. At the same time, such
+matrices also reduce the sharpened aspect common in error diffusion
+techniques. </p>
+
+<p> Ostromoukhov suggests error diffusion values that vary according to the
+input value. The list of 256 discrete value triplets for <i>d1</i>, <i>d2</i>
+and <i>d3</i> he provides give pretty good results with serpentine parsing:
+</p>
 
 <p style="text-align: center;">