Newer
Older
* Copyright (C) 2012 Thomas Oster <thomas.oster@rwth-aachen.de>
* RWTH Aachen University - 52062 Aachen, Germany
*
* VisiCut is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* VisiCut is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with VisiCut. If not, see <http://www.gnu.org/licenses/>.
**/
package com.t_oster.liblasercut.dithering;
/**
*
* @author Thomas Oster <thomas.oster@rwth-aachen.de>
*/
public class Ordered extends DitheringAlgorithm
{
Thomas Oster
committed
@Override
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
protected void doDithering()
{
int width = src.getWidth();
int height = src.getHeight();
int nPatWid = 4;
int[][] filter =
{
{
16, 144, 48, 176
},
{
208, 80, 240, 112
},
{
64, 192, 32, 160
},
{
256, 128, 224, 96
},
};
int x = 0;
int y = 0;
int pixelcount = 0;
for (y = 0; y < (height - nPatWid); y = y + nPatWid)
{
for (x = 0; x < (width - nPatWid); x = x + nPatWid)
{
for (int xdelta = 0; xdelta < nPatWid; xdelta++)
{
for (int ydelta = 0; ydelta < nPatWid; ydelta++)
{
this.setBlack(x + xdelta, y + ydelta, src.getGreyScale(x + xdelta, y + ydelta) < filter[xdelta][ydelta]);
}
}
}
for (int xdelta = 0; xdelta < nPatWid; xdelta++)
{
for (int ydelta = 0; ydelta < nPatWid; ydelta++)
{
if (((x + xdelta) < width) && ((y + ydelta) < height))
{
this.setBlack(x + xdelta, y + ydelta, src.getGreyScale(x + xdelta, y + ydelta) < filter[xdelta][ydelta]);
}
}
}
setProgress((100 * pixelcount++) / (height));
}
// y is at max; loop through x
for (x = 0; x < (width); x = x + nPatWid)
{
for (int xdelta = 0; xdelta < nPatWid; xdelta++)
{
for (int ydelta = 0; ydelta < nPatWid; ydelta++)
{
if (((x + xdelta) < width) && ((y + ydelta) < height))
{
this.setBlack(x + xdelta, y + ydelta, src.getGreyScale(x + xdelta, y + ydelta) < filter[xdelta][ydelta]);
}
}
}
}
}
Thomas Oster
committed
@Override
public DitheringAlgorithm clone() {
return new Ordered();
}
@Override
public String toString()
{
return "Ordered";
}