1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/*
* This file is part of Chalk
*
* Copyright (c) 2004 Michael Thaler <michael.thaler@physik.tu-muenchen.de>
*
* ported from digikam, Copyright 2004 by Gilles Caulier,
* Original Emboss algorithm copyrighted 2004 by
* Pieter Z. Voloshyn <pieter_voloshyn at ame.com.br>.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <stdlib.h>
#include <vector>
#include <tqpoint.h>
#include <tqspinbox.h>
#include <tdelocale.h>
#include <kiconloader.h>
#include <kinstance.h>
#include <tdemessagebox.h>
#include <kstandarddirs.h>
#include <tdetempfile.h>
#include <kdebug.h>
#include <kgenericfactory.h>
#include <knuminput.h>
#include <kis_doc.h>
#include <kis_image.h>
#include <kis_iterators_pixel.h>
#include <kis_layer.h>
#include <kis_filter_registry.h>
#include <kis_global.h>
#include <kis_types.h>
#include <kis_view.h>
#include "kis_multi_integer_filter_widget.h"
#include "kis_emboss_filter.h"
KisEmbossFilter::KisEmbossFilter() : KisFilter(id(), "emboss", i18n("&Emboss with Variable Depth..."))
{
}
void KisEmbossFilter::process(KisPaintDeviceSP src, KisPaintDeviceSP dst, KisFilterConfiguration* configuration, const TQRect& rect)
{
Q_UNUSED(dst);
//read the filter configuration values from the KisFilterConfiguration object
TQ_UINT32 embossdepth = ((KisEmbossFilterConfiguration*)configuration)->depth();
//the actual filter function from digikam. It needs a pointer to a TQ_UINT8 array
//with the actual pixel data.
Emboss(src, dst, rect, embossdepth);
}
// This method have been ported from Pieter Z. Voloshyn algorithm code.
/* Function to apply the Emboss effect
*
* data => The image data in RGBA mode.
* Width => Width of image.
* Height => Height of image.
* d => Emboss value
*
* Theory => This is an amazing effect. And the theory is very simple to
* understand. You get the diference between the colors and
* increase it. After this, get the gray tone
*/
void KisEmbossFilter::Emboss(KisPaintDeviceSP src, KisPaintDeviceSP dst, const TQRect& rect, int d)
{
float Depth = d / 10.0;
int R = 0, G = 0, B = 0;
uchar Gray = 0;
int Width = rect.width();
int Height = rect.height();
setProgressTotalSteps(Height);
setProgressStage(i18n("Applying emboss filter..."),0);
KisHLineIteratorPixel it = src->createHLineIterator(rect.x(), rect.y(), rect.width(), false);
KisHLineIteratorPixel dstIt = dst->createHLineIterator(rect.x(), rect.y(), rect.width(), true);
TQColor color1;
TQColor color2;
TQ_UINT8 opacity;
TQ_UINT8 opacity2;
for (int y = 0 ; !cancelRequested() && (y < Height) ; ++y)
{
for (int x = 0 ; !cancelRequested() && (x < Width) ; ++x, ++it, ++dstIt)
{
if (it.isSelected()) {
// XXX: COLORSPACE_INDEPENDENCE
opacity = 0;
opacity2 = 0;
src->colorSpace()->toTQColor(it.rawData(), &color1, &opacity);
src->pixel(rect.x() + x + Lim_Max(x, 1, Width), rect.y() + y + Lim_Max(y, 1, Height), &color2, &opacity2);
R = abs((int)((color1.red() - color2.red()) * Depth + (TQ_UINT8_MAX / 2)));
G = abs((int)((color1.green() - color2.green()) * Depth + (TQ_UINT8_MAX / 2)));
B = abs((int)((color1.blue() - color2.blue()) * Depth + (TQ_UINT8_MAX / 2)));
Gray = CLAMP((R + G + B) / 3, 0, TQ_UINT8_MAX);
dst->colorSpace()->fromTQColor(TQColor(Gray, Gray, Gray), opacity, dstIt.rawData());
}
}
it.nextRow();
dstIt.nextRow();
setProgress(y);
}
setProgressDone();
}
// This method have been ported from Pieter Z. Voloshyn algorithm code.
/* This function limits the max and min values
* defined by the developer
*
* Now => Original value
* Up => Increments
* Max => Maximum value
*
* Theory => This function is used in some functions to limit the
* "for step". E.g. I have a picture with 309 pixels (width), and
* my "for step" is 5. All the code go alright until reachs the
* w = 305, because in the next step w will go to 310, but we want
* to analize all the pixels. So, this function will reduce the
* "for step", when necessary, until reach the last possible value
*/
int KisEmbossFilter::Lim_Max (int Now, int Up, int Max)
{
--Max;
while (Now > Max - Up)
--Up;
return (Up);
}
KisFilterConfigWidget * KisEmbossFilter::createConfigurationWidget(TQWidget* parent, KisPaintDeviceSP)
{
vKisIntegerWidgetParam param;
param.push_back( KisIntegerWidgetParam( 10, 300, 30, i18n("Depth"), "depth" ) );
KisFilterConfigWidget * w = new KisMultiIntegerFilterWidget(parent, id().id().ascii(), id().id().ascii(), param );
TQ_CHECK_PTR(w);
return w;
}
KisFilterConfiguration* KisEmbossFilter::configuration(TQWidget* nwidget)
{
KisMultiIntegerFilterWidget* widget = (KisMultiIntegerFilterWidget*) nwidget;
if( widget == 0 )
{
return new KisEmbossFilterConfiguration( 30 );
} else {
return new KisEmbossFilterConfiguration( widget->valueAt( 0 ) );
}
}
|
