1 /* scale.c - image scaling
3 * Raster graphics library
5 * Copyright (c) 1997-2003 Alfredo K. Kojima
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Library General Public
9 * License as published by the Free Software Foundation; either
10 * version 2 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Library General Public License for more details.
17 * You should have received a copy of the GNU Library General Public
18 * License along with this library; if not, write to the Free
19 * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
36 *----------------------------------------------------------------------
38 * Creates a scaled copy of an image.
41 * The new scaled image.
43 *----------------------------------------------------------------------
45 RImage
*RScaleImage(RImage
* image
, unsigned new_width
, unsigned new_height
)
58 if (new_width
== image
->width
&& new_height
== image
->height
)
59 return RCloneImage(image
);
61 img
= RCreateImage(new_width
, new_height
, image
->format
== RRGBAFormat
);
66 /* fixed point math idea taken from Imlib by
67 * Carsten Haitzler (Rasterman) */
68 dx
= (image
->width
<< 16) / new_width
;
69 dy
= (image
->height
<< 16) / new_height
;
75 if (image
->format
== RRGBAFormat
) {
76 for (y
= 0; y
< new_height
; y
++) {
77 t
= image
->width
* (py
>> 16);
79 s
= image
->data
+ (t
<< 2); /* image->data+t*4 */
83 for (x
= 0; x
< new_width
; x
++) {
94 s
+= t
<< 2; /* t*4 */
99 for (y
= 0; y
< new_height
; y
++) {
100 t
= image
->width
* (py
>> 16);
102 s
= image
->data
+ (t
<< 1) + t
; /* image->data+t*3 */
106 for (x
= 0; x
< new_width
; x
++) {
116 s
+= (t
<< 1) + t
; /* t*3 */
126 * Filtered Image Rescaling code copy/pasted from
128 * Public Domain 1991 by Dale Schumacher
132 * filter function definitions
134 #define box_support (0.5)
136 static double box_filter(double t
)
138 if ((t
> -0.5) && (t
<= 0.5))
143 #define triangle_support (1.0)
145 static double triangle_filter(double t
)
154 #define bell_support (1.5)
156 static double bell_filter(double t
) /* box (*) box (*) box */
161 return (.75 - (t
* t
));
164 return (.5 * (t
* t
));
169 #define B_spline_support (2.0)
171 static double B_spline_filter(double t
) /* box (*) box (*) box (*) box */
179 return ((.5 * tt
* t
) - tt
+ (2.0 / 3.0));
182 return ((1.0 / 6.0) * (t
* t
* t
));
187 static double sinc(double x
)
190 * The original code did this:
192 * This code is unsafe, it should be:
193 * if (fabs(x) > EPSILON) ...
195 * But the call to fabs is already done in the *ONLY* function
196 * that call sinc: 'Lanczos3_filter'
198 * The goal was to avoid a Divide-by-0 error, now we also
199 * avoid a +/-inf result too
207 #define Lanczos3_support (3.0)
209 static double Lanczos3_filter(double t
)
214 return (sinc(t
) * sinc(t
/ 3.0));
218 #define Mitchell_support (2.0)
220 #define B (1.0 / 3.0)
221 #define C (1.0 / 3.0)
223 static double Mitchell_filter(double t
)
231 t
= (((12.0 - 9.0 * B
- 6.0 * C
) * (t
* tt
))
232 + ((-18.0 + 12.0 * B
+ 6.0 * C
) * tt
)
235 } else if (t
< 2.0) {
236 t
= (((-1.0 * B
- 6.0 * C
) * (t
* tt
))
237 + ((6.0 * B
+ 30.0 * C
) * tt
)
238 + ((-12.0 * B
- 48.0 * C
) * t
)
239 + (8.0 * B
+ 24 * C
));
245 static double (*filterf
)(double) = Mitchell_filter
;
246 static double fwidth
= Mitchell_support
;
248 void wraster_change_filter(RScalingFilter type
)
252 filterf
= box_filter
;
253 fwidth
= box_support
;
255 case RTriangleFilter
:
256 filterf
= triangle_filter
;
257 fwidth
= triangle_support
;
260 filterf
= bell_filter
;
261 fwidth
= bell_support
;
264 filterf
= B_spline_filter
;
265 fwidth
= B_spline_support
;
267 case RLanczos3Filter
:
268 filterf
= Lanczos3_filter
;
269 fwidth
= Lanczos3_support
;
272 case RMitchellFilter
:
273 filterf
= Mitchell_filter
;
274 fwidth
= Mitchell_support
;
280 * image rescaling routine
289 int n
; /* number of contributors */
290 CONTRIB
*p
; /* pointer to list of contributions */
293 /* clamp the input to the specified range */
294 #define CLAMP(v,l,h) ((v)<(l) ? (l) : (v) > (h) ? (h) : v)
296 /* return of calloc is not checked if NULL in the function below! */
297 RImage
*RSmoothScaleImage(RImage
* src
, unsigned new_width
, unsigned new_height
)
299 CLIST
*contrib
; /* array of contribution lists */
300 RImage
*tmp
; /* intermediate image */
301 double xscale
, yscale
; /* zoom scale factors */
302 int i
, j
, k
; /* loop variables */
303 int n
; /* pixel number */
304 double center
, left
, right
; /* filter calculation variables */
305 double width
, fscale
; /* filter calculation variables */
306 double rweight
, gweight
, bweight
;
310 int sch
= src
->format
== RRGBAFormat
? 4 : 3;
312 dst
= RCreateImage(new_width
, new_height
, False
);
314 /* create intermediate image to hold horizontal zoom */
315 tmp
= RCreateImage(dst
->width
, src
->height
, False
);
316 xscale
= (double)new_width
/ (double)src
->width
;
317 yscale
= (double)new_height
/ (double)src
->height
;
319 /* pre-calculate filter contributions for a row */
320 contrib
= (CLIST
*) calloc(new_width
, sizeof(CLIST
));
322 width
= fwidth
/ xscale
;
323 fscale
= 1.0 / xscale
;
324 for (i
= 0; i
< new_width
; ++i
) {
326 contrib
[i
].p
= (CONTRIB
*) calloc((int) ceil(width
* 2 + 1), sizeof(CONTRIB
));
327 center
= (double)i
/ xscale
;
328 left
= ceil(center
- width
);
329 right
= floor(center
+ width
);
330 for (j
= left
; j
<= right
; ++j
) {
331 rweight
= center
- (double)j
;
332 rweight
= (*filterf
) (rweight
/ fscale
) / fscale
;
335 } else if (j
>= src
->width
) {
336 n
= (src
->width
- j
) + src
->width
- 1;
341 contrib
[i
].p
[k
].pixel
= n
* sch
;
342 contrib
[i
].p
[k
].weight
= rweight
;
347 for (i
= 0; i
< new_width
; ++i
) {
349 contrib
[i
].p
= (CONTRIB
*) calloc((int) ceil(fwidth
* 2 + 1), sizeof(CONTRIB
));
350 center
= (double)i
/ xscale
;
351 left
= ceil(center
- fwidth
);
352 right
= floor(center
+ fwidth
);
353 for (j
= left
; j
<= right
; ++j
) {
354 rweight
= center
- (double)j
;
355 rweight
= (*filterf
) (rweight
);
358 } else if (j
>= src
->width
) {
359 n
= (src
->width
- j
) + src
->width
- 1;
364 contrib
[i
].p
[k
].pixel
= n
* sch
;
365 contrib
[i
].p
[k
].weight
= rweight
;
370 /* apply filter to zoom horizontally from src to tmp */
373 for (k
= 0; k
< tmp
->height
; ++k
) {
376 sp
= src
->data
+ src
->width
* k
* sch
;
378 for (i
= 0; i
< tmp
->width
; ++i
) {
379 rweight
= gweight
= bweight
= 0.0;
383 for (j
= 0; j
< contrib
[i
].n
; ++j
) {
384 rweight
+= sp
[pp
[j
].pixel
] * pp
[j
].weight
;
385 gweight
+= sp
[pp
[j
].pixel
+ 1] * pp
[j
].weight
;
386 bweight
+= sp
[pp
[j
].pixel
+ 2] * pp
[j
].weight
;
388 *p
++ = CLAMP(rweight
, 0, 255);
389 *p
++ = CLAMP(gweight
, 0, 255);
390 *p
++ = CLAMP(bweight
, 0, 255);
394 /* free the memory allocated for horizontal filter weights */
395 for (i
= 0; i
< new_width
; ++i
) {
400 /* pre-calculate filter contributions for a column */
401 contrib
= (CLIST
*) calloc(dst
->height
, sizeof(CLIST
));
403 width
= fwidth
/ yscale
;
404 fscale
= 1.0 / yscale
;
405 for (i
= 0; i
< dst
->height
; ++i
) {
407 contrib
[i
].p
= (CONTRIB
*) calloc((int) ceil(width
* 2 + 1), sizeof(CONTRIB
));
408 center
= (double)i
/ yscale
;
409 left
= ceil(center
- width
);
410 right
= floor(center
+ width
);
411 for (j
= left
; j
<= right
; ++j
) {
412 rweight
= center
- (double)j
;
413 rweight
= (*filterf
) (rweight
/ fscale
) / fscale
;
416 } else if (j
>= tmp
->height
) {
417 n
= (tmp
->height
- j
) + tmp
->height
- 1;
422 contrib
[i
].p
[k
].pixel
= n
* 3;
423 contrib
[i
].p
[k
].weight
= rweight
;
427 for (i
= 0; i
< dst
->height
; ++i
) {
429 contrib
[i
].p
= (CONTRIB
*) calloc((int) ceil(fwidth
* 2 + 1), sizeof(CONTRIB
));
430 center
= (double)i
/ yscale
;
431 left
= ceil(center
- fwidth
);
432 right
= floor(center
+ fwidth
);
433 for (j
= left
; j
<= right
; ++j
) {
434 rweight
= center
- (double)j
;
435 rweight
= (*filterf
) (rweight
);
438 } else if (j
>= tmp
->height
) {
439 n
= (tmp
->height
- j
) + tmp
->height
- 1;
444 contrib
[i
].p
[k
].pixel
= n
* 3;
445 contrib
[i
].p
[k
].weight
= rweight
;
450 /* apply filter to zoom vertically from tmp to dst */
451 sp
= malloc(tmp
->height
* 3);
453 for (k
= 0; k
< new_width
; ++k
) {
456 p
= dst
->data
+ k
* 3;
458 /* copy a column into a row */
461 unsigned char *p
, *d
;
464 for (i
= tmp
->height
, p
= tmp
->data
+ k
* 3; i
-- > 0; p
+= tmp
->width
* 3) {
470 for (i
= 0; i
< new_height
; ++i
) {
471 rweight
= gweight
= bweight
= 0.0;
475 for (j
= 0; j
< contrib
[i
].n
; ++j
) {
476 rweight
+= sp
[pp
[j
].pixel
] * pp
[j
].weight
;
477 gweight
+= sp
[pp
[j
].pixel
+ 1] * pp
[j
].weight
;
478 bweight
+= sp
[pp
[j
].pixel
+ 2] * pp
[j
].weight
;
480 *p
= CLAMP(rweight
, 0, 255);
481 *(p
+ 1) = CLAMP(gweight
, 0, 255);
482 *(p
+ 2) = CLAMP(bweight
, 0, 255);
488 /* free the memory allocated for vertical filter weights */
489 for (i
= 0; i
< dst
->height
; ++i
) {