You are here: GdPicture.NET > Documentation > Structs, Records, Enums > Enumerations > BitonalReduction Enumeration
logo.gif
ContentsIndexHome
PreviousUpNext
BitonalReduction Enumeration
C#
public enum BitonalReduction {
  NearestColor = 1,
  OrderedDither = 2,
  Burke = 3,
  Stucki = 4,
  FloydSteinberg = 5
}
Visual Basic
Public Enum BitonalReduction
  NearestColor = 1
  OrderedDither = 2
  Burke = 3
  Stucki = 4
  FloydSteinberg = 5
End Enum

This is record BitonalReduction.

Members
Members 
Description 
NearestColor 
Each pixel value is compared against a fixed threshold. This may be the simplest dithering algorithm there is, but it results in immense loss of detail and contouring. 
OrderedDither 
Produces a cross-hatch pattern. This is a form of dispersed dithering. Because the dots don't cluster, the result looks much less grainy. 
Burke 
A simplified form of Stucki dithering that is faster, but less clean than Stucki dithering. 
Stucki 
Based on Floyd Steinberg, but is slightly faster. Its output tends to be clean and sharp. 
FloydSteinberg 
Only diffuses the error to neighbouring pixels. This results in very fine-grained dithering. 
What do you think about this topic? Send feedback!
Copyright (c) 2009-2011 www.gdpicture.com. All rights reserved.