re-work box() to avoid creating the default color object unless needed
[imager.git] / draw.c
CommitLineData
92bda632 1#include "imager.h"
02d1d628
AMH
2#include "draw.h"
3#include "log.h"
92bda632 4#include "imageri.h"
9b1ec2b8 5#include "imrender.h"
6af18d2b
AMH
6#include <limits.h>
7
40068b33
TC
8int
9i_ppix_norm(i_img *im, i_img_dim x, i_img_dim y, i_color const *col) {
10 i_color src;
11 i_color work;
12 int dest_alpha;
13 int remains;
14
15 if (!col->channel[3])
16 return 0;
17
18 switch (im->channels) {
19 case 1:
20 work = *col;
21 i_adapt_colors(2, 4, &work, 1);
22 i_gpix(im, x, y, &src);
23 remains = 255 - work.channel[1];
24 src.channel[0] = (src.channel[0] * remains
25 + work.channel[0] * work.channel[1]) / 255;
26 return i_ppix(im, x, y, &src);
27
28 case 2:
29 work = *col;
30 i_adapt_colors(2, 4, &work, 1);
31 i_gpix(im, x, y, &src);
32 dest_alpha = work.channel[1] + remains * src.channel[1] / 255;
33 if (work.channel[1] == 255) {
34 return i_ppix(im, x, y, &work);
35 }
36 else {
37 src.channel[0] = (work.channel[1] * work.channel[0]
38 + remains * src.channel[0] * src.channel[1] / 255) / dest_alpha;
39 src.channel[1] = dest_alpha;
40 return i_ppix(im, x, y, &src);
41 }
42
43 case 3:
44 work = *col;
45 i_gpix(im, x, y, &src);
46 remains = 255 - work.channel[3];
47 src.channel[0] = (src.channel[0] * remains
48 + work.channel[0] * work.channel[3]) / 255;
49 src.channel[1] = (src.channel[1] * remains
50 + work.channel[1] * work.channel[3]) / 255;
51 src.channel[2] = (src.channel[2] * remains
52 + work.channel[2] * work.channel[3]) / 255;
53 return i_ppix(im, x, y, &src);
54
55 case 4:
56 work = *col;
57 i_gpix(im, x, y, &src);
58 dest_alpha = work.channel[3] + remains * src.channel[3] / 255;
59 if (work.channel[3] == 255) {
60 return i_ppix(im, x, y, &work);
61 }
62 else {
63 src.channel[0] = (work.channel[3] * work.channel[0]
64 + remains * src.channel[0] * src.channel[3] / 255) / dest_alpha;
65 src.channel[1] = (work.channel[3] * work.channel[1]
66 + remains * src.channel[1] * src.channel[3] / 255) / dest_alpha;
67 src.channel[2] = (work.channel[3] * work.channel[2]
68 + remains * src.channel[2] * src.channel[3] / 255) / dest_alpha;
69 src.channel[3] = dest_alpha;
70 return i_ppix(im, x, y, &src);
71 }
72 }
73 return 0;
74}
75
3efb0915
TC
76static void
77cfill_from_btm(i_img *im, i_fill_t *fill, struct i_bitmap *btm,
78 int bxmin, int bxmax, int bymin, int bymax);
79
02d1d628
AMH
80void
81i_mmarray_cr(i_mmarray *ar,int l) {
82 int i;
f0960b14 83 int alloc_size;
02d1d628
AMH
84
85 ar->lines=l;
f0960b14
TC
86 alloc_size = sizeof(minmax) * l;
87 /* check for overflow */
88 if (alloc_size / l != sizeof(minmax)) {
89 fprintf(stderr, "overflow calculating memory allocation");
90 exit(3);
91 }
92 ar->data=mymalloc(alloc_size); /* checked 5jul05 tonyc */
02d1d628
AMH
93 for(i=0;i<l;i++) { ar->data[i].max=-1; ar->data[i].min=MAXINT; }
94}
95
96void
97i_mmarray_dst(i_mmarray *ar) {
98 ar->lines=0;
99 if (ar->data != NULL) { myfree(ar->data); ar->data=NULL; }
100}
101
102void
103i_mmarray_add(i_mmarray *ar,int x,int y) {
104 if (y>-1 && y<ar->lines)
105 {
106 if (x<ar->data[y].min) ar->data[y].min=x;
107 if (x>ar->data[y].max) ar->data[y].max=x;
108 }
109}
110
111int
112i_mmarray_gmin(i_mmarray *ar,int y) {
113 if (y>-1 && y<ar->lines) return ar->data[y].min;
114 else return -1;
115}
116
117int
118i_mmarray_getm(i_mmarray *ar,int y) {
119 if (y>-1 && y<ar->lines) return ar->data[y].max;
120 else return MAXINT;
121}
122
123void
124i_mmarray_render(i_img *im,i_mmarray *ar,i_color *val) {
125 int i,x;
126 for(i=0;i<ar->lines;i++) if (ar->data[i].max!=-1) for(x=ar->data[i].min;x<ar->data[i].max;x++) i_ppix(im,x,i,val);
127}
128
02d1d628
AMH
129static
130void
131i_arcdraw(int x1, int y1, int x2, int y2, i_mmarray *ar) {
132 double alpha;
133 double dsec;
134 int temp;
135 alpha=(double)(y2-y1)/(double)(x2-x1);
b254292b 136 if (fabs(alpha) <= 1)
02d1d628
AMH
137 {
138 if (x2<x1) { temp=x1; x1=x2; x2=temp; temp=y1; y1=y2; y2=temp; }
139 dsec=y1;
b254292b 140 while(x1<=x2)
02d1d628 141 {
02d1d628 142 i_mmarray_add(ar,x1,(int)(dsec+0.5));
b254292b 143 dsec+=alpha;
02d1d628
AMH
144 x1++;
145 }
146 }
147 else
148 {
149 alpha=1/alpha;
150 if (y2<y1) { temp=x1; x1=x2; x2=temp; temp=y1; y1=y2; y2=temp; }
151 dsec=x1;
b254292b 152 while(y1<=y2)
02d1d628 153 {
02d1d628 154 i_mmarray_add(ar,(int)(dsec+0.5),y1);
b254292b 155 dsec+=alpha;
02d1d628
AMH
156 y1++;
157 }
158 }
159}
160
161void
162i_mmarray_info(i_mmarray *ar) {
163 int i;
164 for(i=0;i<ar->lines;i++)
165 if (ar->data[i].max!=-1) printf("line %d: min=%d, max=%d.\n",i,ar->data[i].min,ar->data[i].max);
166}
167
a8652edf
TC
168static void
169i_arc_minmax(i_int_hlines *hlines,int x,int y,float rad,float d1,float d2) {
02d1d628
AMH
170 i_mmarray dot;
171 float f,fx,fy;
172 int x1,y1;
173
a8652edf 174 /*mm_log((1,"i_arc(im* 0x%x,x %d,y %d,rad %.2f,d1 %.2f,d2 %.2f,val 0x%x)\n",im,x,y,rad,d1,d2,val));*/
02d1d628 175
a8652edf 176 i_mmarray_cr(&dot, hlines->limit_y);
02d1d628
AMH
177
178 x1=(int)(x+0.5+rad*cos(d1*PI/180.0));
179 y1=(int)(y+0.5+rad*sin(d1*PI/180.0));
180 fx=(float)x1; fy=(float)y1;
181
182 /* printf("x1: %d.\ny1: %d.\n",x1,y1); */
183 i_arcdraw(x, y, x1, y1, &dot);
184
185 x1=(int)(x+0.5+rad*cos(d2*PI/180.0));
186 y1=(int)(y+0.5+rad*sin(d2*PI/180.0));
187
188 for(f=d1;f<=d2;f+=0.01) i_mmarray_add(&dot,(int)(x+0.5+rad*cos(f*PI/180.0)),(int)(y+0.5+rad*sin(f*PI/180.0)));
6af18d2b 189
02d1d628
AMH
190 /* printf("x1: %d.\ny1: %d.\n",x1,y1); */
191 i_arcdraw(x, y, x1, y1, &dot);
192
a8652edf
TC
193 /* render the minmax values onto the hlines */
194 for (y = 0; y < dot.lines; y++) {
195 if (dot.data[y].max!=-1) {
196 int minx, width;
197 minx = dot.data[y].min;
198 width = dot.data[y].max - dot.data[y].min + 1;
199 i_int_hlines_add(hlines, y, minx, width);
200 }
201 }
202
02d1d628 203 /* dot.info(); */
7f882a01 204 i_mmarray_dst(&dot);
02d1d628
AMH
205}
206
a8652edf
TC
207static void
208i_arc_hlines(i_int_hlines *hlines,int x,int y,float rad,float d1,float d2) {
209 if (d1 <= d2) {
210 i_arc_minmax(hlines, x, y, rad, d1, d2);
211 }
212 else {
213 i_arc_minmax(hlines, x, y, rad, d1, 360);
214 i_arc_minmax(hlines, x, y, rad, 0, d2);
215 }
216}
217
92bda632
TC
218/*
219=item i_arc(im, x, y, rad, d1, d2, color)
220
221=category Drawing
222=synopsis i_arc(im, 50, 50, 20, 45, 135, &color);
223
224Fills an arc centered at (x,y) with radius I<rad> covering the range
225of angles in degrees from d1 to d2, with the color.
226
227=cut
228*/
229
a8652edf 230void
97ac0a96 231i_arc(i_img *im,int x,int y,float rad,float d1,float d2,const i_color *val) {
a8652edf
TC
232 i_int_hlines hlines;
233
234 i_int_init_hlines_img(&hlines, im);
235
236 i_arc_hlines(&hlines, x, y, rad, d1, d2);
237
238 i_int_hlines_fill_color(im, &hlines, val);
239
240 i_int_hlines_destroy(&hlines);
241}
242
92bda632
TC
243/*
244=item i_arc_cfill(im, x, y, rad, d1, d2, fill)
245
246=category Drawing
247=synopsis i_arc_cfill(im, 50, 50, 35, 90, 135, fill);
248
249Fills an arc centered at (x,y) with radius I<rad> covering the range
250of angles in degrees from d1 to d2, with the fill object.
251
252=cut
253*/
254
a8652edf
TC
255#define MIN_CIRCLE_STEPS 8
256#define MAX_CIRCLE_STEPS 360
257
f1ac5027
TC
258void
259i_arc_cfill(i_img *im,int x,int y,float rad,float d1,float d2,i_fill_t *fill) {
a8652edf 260 i_int_hlines hlines;
f1ac5027 261
a8652edf 262 i_int_init_hlines_img(&hlines, im);
f1ac5027 263
a8652edf 264 i_arc_hlines(&hlines, x, y, rad, d1, d2);
f1ac5027 265
a8652edf 266 i_int_hlines_fill_fill(im, &hlines, fill);
f1ac5027 267
a8652edf
TC
268 i_int_hlines_destroy(&hlines);
269}
f1ac5027 270
a8652edf
TC
271static void
272arc_poly(int *count, double **xvals, double **yvals,
273 double x, double y, double rad, double d1, double d2) {
274 double d1_rad, d2_rad;
275 double circum;
276 int steps, point_count;
277 double angle_inc;
278
279 /* normalize the angles */
280 d1 = fmod(d1, 360);
281 if (d1 == 0) {
282 if (d2 >= 360) { /* default is 361 */
283 d2 = 360;
284 }
285 else {
286 d2 = fmod(d2, 360);
287 if (d2 < d1)
288 d2 += 360;
289 }
290 }
291 else {
292 d2 = fmod(d2, 360);
293 if (d2 < d1)
294 d2 += 360;
295 }
296 d1_rad = d1 * PI / 180;
297 d2_rad = d2 * PI / 180;
298
299 /* how many segments for the curved part?
300 we do a maximum of one per degree, with a minimum of 8/circle
301 we try to aim at having about one segment per 2 pixels
302 Work it out per circle to get a step size.
303
304 I was originally making steps = circum/2 but that looked horrible.
305
306 I think there might be an issue in the polygon filler.
307 */
308 circum = 2 * PI * rad;
309 steps = circum;
310 if (steps > MAX_CIRCLE_STEPS)
311 steps = MAX_CIRCLE_STEPS;
312 else if (steps < MIN_CIRCLE_STEPS)
313 steps = MIN_CIRCLE_STEPS;
314
315 angle_inc = 2 * PI / steps;
316
317 point_count = steps + 5; /* rough */
e310e5f9
TC
318 /* point_count is always relatively small, so allocation won't overflow */
319 *xvals = mymalloc(point_count * sizeof(double)); /* checked 17feb2005 tonyc */
320 *yvals = mymalloc(point_count * sizeof(double)); /* checked 17feb2005 tonyc */
a8652edf
TC
321
322 /* from centre to edge at d1 */
323 (*xvals)[0] = x;
324 (*yvals)[0] = y;
325 (*xvals)[1] = x + rad * cos(d1_rad);
326 (*yvals)[1] = y + rad * sin(d1_rad);
327 *count = 2;
328
329 /* step around the curve */
330 while (d1_rad < d2_rad) {
331 (*xvals)[*count] = x + rad * cos(d1_rad);
332 (*yvals)[*count] = y + rad * sin(d1_rad);
333 ++*count;
334 d1_rad += angle_inc;
335 }
f1ac5027 336
a8652edf
TC
337 /* finish off the curve */
338 (*xvals)[*count] = x + rad * cos(d2_rad);
339 (*yvals)[*count] = y + rad * sin(d2_rad);
340 ++*count;
341}
f1ac5027 342
92bda632
TC
343/*
344=item i_arc_aa(im, x, y, rad, d1, d2, color)
345
346=category Drawing
347=synopsis i_arc_aa(im, 50, 50, 35, 90, 135, &color);
348
5715f7c3 349Anti-alias fills an arc centered at (x,y) with radius I<rad> covering
92bda632
TC
350the range of angles in degrees from d1 to d2, with the color.
351
352=cut
353*/
354
a8652edf
TC
355void
356i_arc_aa(i_img *im, double x, double y, double rad, double d1, double d2,
97ac0a96 357 const i_color *val) {
a8652edf
TC
358 double *xvals, *yvals;
359 int count;
360
6b8fe08b 361 arc_poly(&count, &xvals, &yvals, x, y, rad, d1, d2);
a8652edf
TC
362
363 i_poly_aa(im, count, xvals, yvals, val);
364
365 myfree(xvals);
366 myfree(yvals);
f1ac5027
TC
367}
368
92bda632
TC
369/*
370=item i_arc_aa_cfill(im, x, y, rad, d1, d2, fill)
371
372=category Drawing
373=synopsis i_arc_aa_cfill(im, 50, 50, 35, 90, 135, fill);
374
5715f7c3 375Anti-alias fills an arc centered at (x,y) with radius I<rad> covering
92bda632
TC
376the range of angles in degrees from d1 to d2, with the fill object.
377
378=cut
379*/
380
a8652edf
TC
381void
382i_arc_aa_cfill(i_img *im, double x, double y, double rad, double d1, double d2,
383 i_fill_t *fill) {
384 double *xvals, *yvals;
385 int count;
386
387 arc_poly(&count, &xvals, &yvals, x, y, rad, d1, d2);
388
389 i_poly_aa_cfill(im, count, xvals, yvals, fill);
6af18d2b 390
a8652edf
TC
391 myfree(xvals);
392 myfree(yvals);
393}
6af18d2b
AMH
394
395/* Temporary AA HACK */
396
397
398typedef int frac;
399static frac float_to_frac(float x) { return (frac)(0.5+x*16.0); }
6af18d2b
AMH
400
401static
402void
403polar_to_plane(float cx, float cy, float angle, float radius, frac *x, frac *y) {
404 *x = float_to_frac(cx+radius*cos(angle));
405 *y = float_to_frac(cy+radius*sin(angle));
406}
407
6af18d2b
AMH
408static
409void
410make_minmax_list(i_mmarray *dot, float x, float y, float radius) {
411 float angle = 0.0;
412 float astep = radius>0.1 ? .5/radius : 10;
413 frac cx, cy, lx, ly, sx, sy;
414
415 mm_log((1, "make_minmax_list(dot %p, x %.2f, y %.2f, radius %.2f)\n", dot, x, y, radius));
416
417 polar_to_plane(x, y, angle, radius, &sx, &sy);
418
419 for(angle = 0.0; angle<361; angle +=astep) {
6af18d2b
AMH
420 lx = sx; ly = sy;
421 polar_to_plane(x, y, angle, radius, &cx, &cy);
422 sx = cx; sy = cy;
423
424 if (fabs(cx-lx) > fabs(cy-ly)) {
425 int ccx, ccy;
426 if (lx>cx) {
427 ccx = lx; lx = cx; cx = ccx;
428 ccy = ly; ly = cy; cy = ccy;
429 }
430
431 for(ccx=lx; ccx<=cx; ccx++) {
432 ccy = ly + ((cy-ly)*(ccx-lx))/(cx-lx);
433 i_mmarray_add(dot, ccx, ccy);
434 }
435 } else {
436 int ccx, ccy;
437
438 if (ly>cy) {
439 ccy = ly; ly = cy; cy = ccy;
440 ccx = lx; lx = cx; cx = ccx;
441 }
442
443 for(ccy=ly; ccy<=cy; ccy++) {
444 if (cy-ly) ccx = lx + ((cx-lx)*(ccy-ly))/(cy-ly); else ccx = lx;
445 i_mmarray_add(dot, ccx, ccy);
446 }
447 }
448 }
449}
450
451/* Get the number of subpixels covered */
452
453static
454int
455i_pixel_coverage(i_mmarray *dot, int x, int y) {
456 frac minx = x*16;
457 frac maxx = minx+15;
458 frac cy;
459 int cnt = 0;
460
461 for(cy=y*16; cy<(y+1)*16; cy++) {
462 frac tmin = dot->data[cy].min;
463 frac tmax = dot->data[cy].max;
464
465 if (tmax == -1 || tmin > maxx || tmax < minx) continue;
466
467 if (tmin < minx) tmin = minx;
468 if (tmax > maxx) tmax = maxx;
469
470 cnt+=1+tmax-tmin;
471 }
472 return cnt;
473}
474
92bda632
TC
475/*
476=item i_circle_aa(im, x, y, rad, color)
477
478=category Drawing
479=synopsis i_circle_aa(im, 50, 50, 45, &color);
480
5715f7c3 481Anti-alias fills a circle centered at (x,y) for radius I<rad> with
92bda632
TC
482color.
483
484=cut
485*/
6af18d2b 486void
97ac0a96 487i_circle_aa(i_img *im, float x, float y, float rad, const i_color *val) {
6af18d2b
AMH
488 i_mmarray dot;
489 i_color temp;
490 int ly;
491
492 mm_log((1, "i_circle_aa(im %p, x %d, y %d, rad %.2f, val %p)\n", im, x, y, rad, val));
493
494 i_mmarray_cr(&dot,16*im->ysize);
495 make_minmax_list(&dot, x, y, rad);
496
497 for(ly = 0; ly<im->ysize; ly++) {
a659442a 498 int ix, cy, minx = INT_MAX, maxx = INT_MIN;
6af18d2b
AMH
499
500 /* Find the left/rightmost set subpixels */
501 for(cy = 0; cy<16; cy++) {
502 frac tmin = dot.data[ly*16+cy].min;
503 frac tmax = dot.data[ly*16+cy].max;
504 if (tmax == -1) continue;
505
506 if (minx > tmin) minx = tmin;
507 if (maxx < tmax) maxx = tmax;
508 }
509
510 if (maxx == INT_MIN) continue; /* no work to be done for this row of pixels */
511
512 minx /= 16;
513 maxx /= 16;
514 for(ix=minx; ix<=maxx; ix++) {
515 int cnt = i_pixel_coverage(&dot, ix, ly);
516 if (cnt>255) cnt = 255;
517 if (cnt) { /* should never be true */
518 int ch;
519 float ratio = (float)cnt/255.0;
520 i_gpix(im, ix, ly, &temp);
521 for(ch=0;ch<im->channels; ch++) temp.channel[ch] = (unsigned char)((float)val->channel[ch]*ratio + (float)temp.channel[ch]*(1.0-ratio));
522 i_ppix(im, ix, ly, &temp);
523 }
524 }
525 }
4b19f77a 526 i_mmarray_dst(&dot);
6af18d2b
AMH
527}
528
40068b33
TC
529/*
530=item i_circle_out(im, x, y, r, col)
531
532=category Drawing
533=synopsis i_circle_out(im, 50, 50, 45, &color);
534
535Draw a circle outline centered at (x,y) with radius r,
536non-anti-aliased.
537
538Parameters:
539
540=over
541
542=item *
543
544(x, y) - the center of the circle
545
546=item *
547
548r - the radius of the circle in pixels, must be non-negative
549
550=back
551
552Returns non-zero on success.
553
554Implementation:
555
556=cut
557*/
558
559int
560i_circle_out(i_img *im, i_img_dim xc, i_img_dim yc, i_img_dim r,
561 const i_color *col) {
562 i_img_dim x, y;
563 i_img_dim dx, dy;
564 int error;
565
566 i_clear_error();
567
568 if (r < 0) {
569 i_push_error(0, "circle: radius must be non-negative");
570 return 0;
571 }
572
573 i_ppix(im, xc+r, yc, col);
574 i_ppix(im, xc-r, yc, col);
575 i_ppix(im, xc, yc+r, col);
576 i_ppix(im, xc, yc-r, col);
577
578 x = 0;
579 y = r;
580 dx = 1;
581 dy = -2 * r;
582 error = 1 - r;
583 while (x < y) {
584 if (error >= 0) {
585 --y;
586 dy += 2;
587 error += dy;
588 }
589 ++x;
590 dx += 2;
591 error += dx;
592
593 i_ppix(im, xc + x, yc + y, col);
594 i_ppix(im, xc + x, yc - y, col);
595 i_ppix(im, xc - x, yc + y, col);
596 i_ppix(im, xc - x, yc - y, col);
597 if (x != y) {
598 i_ppix(im, xc + y, yc + x, col);
599 i_ppix(im, xc + y, yc - x, col);
600 i_ppix(im, xc - y, yc + x, col);
601 i_ppix(im, xc - y, yc - x, col);
602 }
603 }
604
605 return 1;
606}
607
608/*
609=item arc_seg(angle)
610
611Convert an angle in degrees into an angle measure we can generate
612simply from the numbers we have when drawing the circle.
613
614=back
615*/
616
617static i_img_dim
618arc_seg(double angle, int scale) {
619 i_img_dim seg = (angle + 45) / 90;
620 double remains = angle - seg * 90; /* should be in the range [-45,45] */
621 int sign = remains < 0 ? -1 : remains ? 1 : 0;
622
623 while (seg > 4)
624 seg -= 4;
625 if (seg == 4 && remains > 0)
626 seg = 0;
627
628 return scale * (seg * 2 + sin(remains * PI/180));
629}
630
631/*
632=item i_arc_out(im, x, y, r, d1, d2, col)
633
634=category Drawing
635=synopsis i_arc_out(im, 50, 50, 45, 45, 135, &color);
636
637Draw an arc outline centered at (x,y) with radius r, non-anti-aliased
638over the angle range d1 through d2 degrees.
639
640Parameters:
641
642=over
643
644=item *
645
646(x, y) - the center of the circle
647
648=item *
649
650r - the radius of the circle in pixels, must be non-negative
651
652=item *
653
654d1, d2 - the range of angles to draw the arc over, in degrees.
655
656=back
657
658Returns non-zero on success.
659
660Implementation:
661
662=cut
663*/
664
665int
666i_arc_out(i_img *im, i_img_dim xc, i_img_dim yc, i_img_dim r,
667 float d1, float d2, const i_color *col) {
668 i_img_dim x, y;
669 i_img_dim dx, dy;
670 int error;
671 i_img_dim segs[2][2];
672 int seg_count;
673 i_img_dim sin_th;
674 i_img_dim seg_d1, seg_d2;
675 int seg_num;
676 double inv_r;
677 i_img_dim scale = r + 1;
678 i_img_dim seg1 = scale * 2;
679 i_img_dim seg2 = scale * 4;
680 i_img_dim seg3 = scale * 6;
681 i_img_dim seg4 = scale * 8;
682
683 i_clear_error();
684
685 if (r <= 0) {
686 i_push_error(0, "arc: radius must be non-negative");
687 return 0;
688 }
689 if (d1 + 360 <= d2)
690 return i_circle_out(im, xc, yc, r, col);
691
692 if (d1 < 0)
693 d1 += 360 * floor((-d1 + 359) / 360);
694 if (d2 < 0)
695 d2 += 360 * floor((-d2 + 359) / 360);
696 d1 = fmod(d1, 360);
697 d2 = fmod(d2, 360);
698 seg_d1 = arc_seg(d1, scale);
699 seg_d2 = arc_seg(d2, scale);
700 if (seg_d2 < seg_d1) {
701 /* split into two segments */
702 segs[0][0] = 0;
703 segs[0][1] = seg_d2;
704 segs[1][0] = seg_d1;
705 segs[1][1] = seg4;
706 seg_count = 2;
707 }
708 else {
709 segs[0][0] = seg_d1;
710 segs[0][1] = seg_d2;
711 seg_count = 1;
712 }
713
714 for (seg_num = 0; seg_num < seg_count; ++seg_num) {
715 i_img_dim seg_start = segs[seg_num][0];
716 i_img_dim seg_end = segs[seg_num][1];
717 if (seg_start == 0)
718 i_ppix(im, xc+r, yc, col);
719 if (seg_start <= seg1 && seg_end >= seg1)
720 i_ppix(im, xc, yc+r, col);
721 if (seg_start <= seg2 && seg_end >= seg2)
722 i_ppix(im, xc-r, yc, col);
723 if (seg_start <= seg3 && seg_end >= seg3)
724 i_ppix(im, xc, yc-r, col);
725
726 y = 0;
727 x = r;
728 dy = 1;
729 dx = -2 * r;
730 error = 1 - r;
731 while (y < x) {
732 if (error >= 0) {
733 --x;
734 dx += 2;
735 error += dx;
736 }
737 ++y;
738 dy += 2;
739 error += dy;
740
741 sin_th = y;
742 if (seg_start <= sin_th && seg_end >= sin_th)
743 i_ppix(im, xc + x, yc + y, col);
744 if (seg_start <= seg1 - sin_th && seg_end >= seg1 - sin_th)
745 i_ppix(im, xc + y, yc + x, col);
746
747 if (seg_start <= seg1 + sin_th && seg_end >= seg1 + sin_th)
748 i_ppix(im, xc - y, yc + x, col);
749 if (seg_start <= seg2 - sin_th && seg_end >= seg2 - sin_th)
750 i_ppix(im, xc - x, yc + y, col);
751
752 if (seg_start <= seg2 + sin_th && seg_end >= seg2 + sin_th)
753 i_ppix(im, xc - x, yc - y, col);
754 if (seg_start <= seg3 - sin_th && seg_end >= seg3 - sin_th)
755 i_ppix(im, xc - y, yc - x, col);
756
757 if (seg_start <= seg3 + sin_th && seg_end >= seg3 + sin_th)
758 i_ppix(im, xc + y, yc - x, col);
759 if (seg_start <= seg4 - sin_th && seg_end >= seg4 - sin_th)
760 i_ppix(im, xc + x, yc - y, col);
761 }
762 }
763
764 return 1;
765}
766
767static double
768cover(i_img_dim r, i_img_dim j) {
769 float rjsqrt = sqrt(r*r - j*j);
770
771 return ceil(rjsqrt) - rjsqrt;
772}
773
774/*
775=item i_circle_out_aa(im, xc, yc, r, col)
776
777=synopsis i_circle_out_aa(im, 50, 50, 45, &color);
778
779Draw a circle outline centered at (x,y) with radius r, anti-aliased.
780
781Parameters:
782
783=over
784
785=item *
786
787(xc, yc) - the center of the circle
788
789=item *
790
791r - the radius of the circle in pixels, must be non-negative
792
793=item *
794
795col - an i_color for the color to draw in.
796
797=back
798
799Returns non-zero on success.
800
801=cut
802
803Based on "Fast Anti-Aliased Circle Generation", Xiaolin Wu, Graphics
804Gems.
805
806I use floating point for I<D> since for large circles the precision of
807a [0,255] value isn't sufficient when approaching the end of the
808octant.
809
810*/
811
812int
813i_circle_out_aa(i_img *im, i_img_dim xc, i_img_dim yc, i_img_dim r, const i_color *col) {
814 i_img_dim i, j;
815 double t;
816 i_color workc = *col;
817 int orig_alpha = col->channel[3];
818
819 i_clear_error();
820 if (r <= 0) {
821 i_push_error(0, "arc: radius must be non-negative");
822 return 0;
823 }
824 i = r;
825 j = 0;
826 t = 0;
827 i_ppix_norm(im, xc+i, yc+j, col);
828 i_ppix_norm(im, xc-i, yc+j, col);
829 i_ppix_norm(im, xc+j, yc+i, col);
830 i_ppix_norm(im, xc+j, yc-i, col);
831
832 while (i > j+1) {
833 double d;
834 int cv, inv_cv;
835 i_color p;
836 int ch;
837 j++;
838 d = cover(r, j);
839 cv = (int)(d * 255 + 0.5);
840 inv_cv = 255-cv;
841 if (d < t) {
842 --i;
843 }
844 if (inv_cv) {
845 workc.channel[3] = orig_alpha * inv_cv / 255;
846 i_ppix_norm(im, xc+i, yc+j, &workc);
847 i_ppix_norm(im, xc-i, yc+j, &workc);
848 i_ppix_norm(im, xc+i, yc-j, &workc);
849 i_ppix_norm(im, xc-i, yc-j, &workc);
850
851 if (i != j) {
852 i_ppix_norm(im, xc+j, yc+i, &workc);
853 i_ppix_norm(im, xc-j, yc+i, &workc);
854 i_ppix_norm(im, xc+j, yc-i, &workc);
855 i_ppix_norm(im, xc-j, yc-i, &workc);
856 }
857 }
858 if (cv && i > j) {
859 workc.channel[3] = orig_alpha * cv / 255;
860 i_ppix_norm(im, xc+i-1, yc+j, &workc);
861 i_ppix_norm(im, xc-i+1, yc+j, &workc);
862 i_ppix_norm(im, xc+i-1, yc-j, &workc);
863 i_ppix_norm(im, xc-i+1, yc-j, &workc);
864
865 if (j != i-1) {
866 i_ppix_norm(im, xc+j, yc+i-1, &workc);
867 i_ppix_norm(im, xc-j, yc+i-1, &workc);
868 i_ppix_norm(im, xc+j, yc-i+1, &workc);
869 i_ppix_norm(im, xc-j, yc-i+1, &workc);
870 }
871 }
872 t = d;
873 }
874
875 return 1;
876}
877
878/*
879=item i_arc_out_aa(im, xc, yc, r, d1, d2, col)
880
881=synopsis i_arc_out_aa(im, 50, 50, 45, 45, 125, &color);
882
883Draw a circle arc outline centered at (x,y) with radius r, from angle
884d1 degrees through angle d2 degrees, anti-aliased.
885
886Parameters:
887
888=over
889
890=item *
891
892(xc, yc) - the center of the circle
893
894=item *
895
896r - the radius of the circle in pixels, must be non-negative
897
898=item *
899
900d1, d2 - the range of angle in degrees to draw the arc through. If
901d2-d1 >= 360 a full circle is drawn.
902
903=back
904
905Returns non-zero on success.
906
907=cut
908
909Based on "Fast Anti-Aliased Circle Generation", Xiaolin Wu, Graphics
910Gems.
911
912*/
913
914int
915i_arc_out_aa(i_img *im, i_img_dim xc, i_img_dim yc, i_img_dim r, float d1, float d2, const i_color *col) {
916 i_img_dim i, j;
917 double t;
918 i_color workc = *col;
919 i_img_dim segs[2][2];
920 int seg_count;
921 i_img_dim sin_th;
922 i_img_dim seg_d1, seg_d2;
923 int seg_num;
924 int orig_alpha = col->channel[3];
925 i_img_dim scale = r + 1;
926 i_img_dim seg1 = scale * 2;
927 i_img_dim seg2 = scale * 4;
928 i_img_dim seg3 = scale * 6;
929 i_img_dim seg4 = scale * 8;
930
931 i_clear_error();
932 if (r <= 0) {
933 i_push_error(0, "arc: radius must be non-negative");
934 return 0;
935 }
936 if (d1 + 360 <= d2)
937 return i_circle_out_aa(im, xc, yc, r, col);
938
939 if (d1 < 0)
940 d1 += 360 * floor((-d1 + 359) / 360);
941 if (d2 < 0)
942 d2 += 360 * floor((-d2 + 359) / 360);
943 d1 = fmod(d1, 360);
944 d2 = fmod(d2, 360);
945 seg_d1 = arc_seg(d1, scale);
946 seg_d2 = arc_seg(d2, scale);
947 if (seg_d2 < seg_d1) {
948 /* split into two segments */
949 segs[0][0] = 0;
950 segs[0][1] = seg_d2;
951 segs[1][0] = seg_d1;
952 segs[1][1] = seg4;
953 seg_count = 2;
954 }
955 else {
956 segs[0][0] = seg_d1;
957 segs[0][1] = seg_d2;
958 seg_count = 1;
959 }
960
961 for (seg_num = 0; seg_num < seg_count; ++seg_num) {
962 i_img_dim seg_start = segs[seg_num][0];
963 i_img_dim seg_end = segs[seg_num][1];
964
965 i = r;
966 j = 0;
967 t = 0;
968
969 if (seg_start == 0)
970 i_ppix_norm(im, xc+i, yc+j, col);
971 if (seg_start <= seg1 && seg_end >= seg1)
972 i_ppix_norm(im, xc+j, yc+i, col);
973 if (seg_start <= seg2 && seg_end >= seg2)
974 i_ppix_norm(im, xc-i, yc+j, col);
975 if (seg_start <= seg3 && seg_end >= seg3)
976 i_ppix_norm(im, xc+j, yc-i, col);
977
978 while (i > j+1) {
979 int cv, inv_cv;
980 i_color p;
981 int ch;
982 double d;
983 j++;
984 d = cover(r, j);
985 cv = (int)(d * 255 + 0.5);
986 inv_cv = 255-cv;
987 if (d < t) {
988 --i;
989 }
990 sin_th = j;
991 if (inv_cv) {
992 workc.channel[3] = orig_alpha * inv_cv / 255;
993
994 if (seg_start <= sin_th && seg_end >= sin_th)
995 i_ppix_norm(im, xc+i, yc+j, &workc);
996 if (seg_start <= seg2 - sin_th && seg_end >= seg2 - sin_th)
997 i_ppix_norm(im, xc-i, yc+j, &workc);
998 if (seg_start <= seg4 - sin_th && seg_end >= seg4 - sin_th)
999 i_ppix_norm(im, xc+i, yc-j, &workc);
1000 if (seg_start <= seg2 + sin_th && seg_end >= seg2 + sin_th)
1001 i_ppix_norm(im, xc-i, yc-j, &workc);
1002
1003 if (i != j) {
1004 if (seg_start <= seg1 - sin_th && seg_end >= seg1 - sin_th)
1005 i_ppix_norm(im, xc+j, yc+i, &workc);
1006 if (seg_start <= seg1 + sin_th && seg_end >= seg1 + sin_th)
1007 i_ppix_norm(im, xc-j, yc+i, &workc);
1008 if (seg_start <= seg3 + sin_th && seg_end >= seg3 + sin_th)
1009 i_ppix_norm(im, xc+j, yc-i, &workc);
1010 if (seg_start <= seg3 - sin_th && seg_end >= seg3 - sin_th)
1011 i_ppix_norm(im, xc-j, yc-i, &workc);
1012 }
1013 }
1014 if (cv && i > j) {
1015 workc.channel[3] = orig_alpha * cv / 255;
1016 if (seg_start <= sin_th && seg_end >= sin_th)
1017 i_ppix_norm(im, xc+i-1, yc+j, &workc);
1018 if (seg_start <= seg2 - sin_th && seg_end >= seg2 - sin_th)
1019 i_ppix_norm(im, xc-i+1, yc+j, &workc);
1020 if (seg_start <= seg4 - sin_th && seg_end >= seg4 - sin_th)
1021 i_ppix_norm(im, xc+i-1, yc-j, &workc);
1022 if (seg_start <= seg2 + sin_th && seg_end >= seg2 + sin_th)
1023 i_ppix_norm(im, xc-i+1, yc-j, &workc);
1024
1025 if (seg_start <= seg1 - sin_th && seg_end >= seg1 - sin_th)
1026 i_ppix_norm(im, xc+j, yc+i-1, &workc);
1027 if (seg_start <= seg1 + sin_th && seg_end >= seg1 + sin_th)
1028 i_ppix_norm(im, xc-j, yc+i-1, &workc);
1029 if (seg_start <= seg3 + sin_th && seg_end >= seg3 + sin_th)
1030 i_ppix_norm(im, xc+j, yc-i+1, &workc);
1031 if (seg_start <= seg3 - sin_th && seg_end >= seg3 - sin_th)
1032 i_ppix_norm(im, xc-j, yc-i+1, &workc);
1033 }
1034 t = d;
1035 }
1036 }
1037
1038 return 1;
1039}
1040
92bda632
TC
1041/*
1042=item i_box(im, x1, y1, x2, y2, color)
6af18d2b 1043
92bda632
TC
1044=category Drawing
1045=synopsis i_box(im, 0, 0, im->xsize-1, im->ysize-1, &color).
6af18d2b 1046
92bda632 1047Outlines the box from (x1,y1) to (x2,y2) inclusive with I<color>.
6af18d2b 1048
92bda632
TC
1049=cut
1050*/
6af18d2b 1051
02d1d628 1052void
97ac0a96 1053i_box(i_img *im,int x1,int y1,int x2,int y2,const i_color *val) {
02d1d628
AMH
1054 int x,y;
1055 mm_log((1,"i_box(im* 0x%x,x1 %d,y1 %d,x2 %d,y2 %d,val 0x%x)\n",im,x1,y1,x2,y2,val));
1056 for(x=x1;x<x2+1;x++) {
1057 i_ppix(im,x,y1,val);
1058 i_ppix(im,x,y2,val);
1059 }
1060 for(y=y1;y<y2+1;y++) {
1061 i_ppix(im,x1,y,val);
1062 i_ppix(im,x2,y,val);
1063 }
1064}
1065
92bda632
TC
1066/*
1067=item i_box_filled(im, x1, y1, x2, y2, color)
1068
1069=category Drawing
1070=synopsis i_box_filled(im, 0, 0, im->xsize-1, im->ysize-1, &color);
1071
1072Fills the box from (x1,y1) to (x2,y2) inclusive with color.
1073
1074=cut
1075*/
1076
02d1d628 1077void
97ac0a96 1078i_box_filled(i_img *im,int x1,int y1,int x2,int y2, const i_color *val) {
02d1d628
AMH
1079 int x,y;
1080 mm_log((1,"i_box_filled(im* 0x%x,x1 %d,y1 %d,x2 %d,y2 %d,val 0x%x)\n",im,x1,y1,x2,y2,val));
1081 for(x=x1;x<x2+1;x++) for (y=y1;y<y2+1;y++) i_ppix(im,x,y,val);
1082}
1083
92bda632
TC
1084/*
1085=item i_box_cfill(im, x1, y1, x2, y2, fill)
1086
1087=category Drawing
1088=synopsis i_box_cfill(im, 0, 0, im->xsize-1, im->ysize-1, fill);
1089
1090Fills the box from (x1,y1) to (x2,y2) inclusive with fill.
1091
1092=cut
1093*/
1094
f1ac5027
TC
1095void
1096i_box_cfill(i_img *im,int x1,int y1,int x2,int y2,i_fill_t *fill) {
9b1ec2b8 1097 i_render r;
f1ac5027
TC
1098 mm_log((1,"i_box_cfill(im* 0x%x,x1 %d,y1 %d,x2 %d,y2 %d,fill 0x%x)\n",im,x1,y1,x2,y2,fill));
1099
1100 ++x2;
f0960b14
TC
1101 if (x1 < 0)
1102 x1 = 0;
1103 if (y1 < 0)
1104 y1 = 0;
1105 if (x2 > im->xsize)
1106 x2 = im->xsize;
1107 if (y2 >= im->ysize)
1108 y2 = im->ysize-1;
1109 if (x1 >= x2 || y1 > y2)
1110 return;
9b1ec2b8
TC
1111
1112 i_render_init(&r, im, x2-x1);
1113 while (y1 <= y2) {
1114 i_render_fill(&r, x1, y1, x2-x1, NULL, fill);
1115 ++y1;
f1ac5027 1116 }
9b1ec2b8 1117 i_render_done(&r);
f1ac5027 1118}
02d1d628 1119
aa833c97 1120/*
5715f7c3 1121=item i_line(C<im>, C<x1>, C<y1>, C<x2>, C<y2>, C<color>, C<endp>)
aa833c97 1122
92bda632
TC
1123=category Drawing
1124
5715f7c3 1125=for stopwords Bresenham's
aa833c97 1126
5715f7c3
TC
1127Draw a line to image using Bresenham's line drawing algorithm
1128
1129 im - image to draw to
1130 x1 - starting x coordinate
1131 y1 - starting x coordinate
1132 x2 - starting x coordinate
1133 y2 - starting x coordinate
1134 color - color to write to image
1135 endp - endpoint flag (boolean)
aa833c97
AMH
1136
1137=cut
1138*/
1139
02d1d628 1140void
97ac0a96 1141i_line(i_img *im, int x1, int y1, int x2, int y2, const i_color *val, int endp) {
aa833c97
AMH
1142 int x, y;
1143 int dx, dy;
1144 int p;
02d1d628 1145
aa833c97
AMH
1146 dx = x2 - x1;
1147 dy = y2 - y1;
02d1d628 1148
aa833c97
AMH
1149
1150 /* choose variable to iterate on */
1151 if (abs(dx)>abs(dy)) {
1152 int dx2, dy2, cpy;
1153
1154 /* sort by x */
1155 if (x1 > x2) {
1156 int t;
1157 t = x1; x1 = x2; x2 = t;
1158 t = y1; y1 = y2; y2 = t;
02d1d628 1159 }
aa833c97
AMH
1160
1161 dx = abs(dx);
1162 dx2 = dx*2;
1163 dy = y2 - y1;
1164
1165 if (dy<0) {
1166 dy = -dy;
1167 cpy = -1;
1168 } else {
1169 cpy = 1;
1170 }
1171 dy2 = dy*2;
1172 p = dy2 - dx;
1173
1174
1175 y = y1;
1176 for(x=x1; x<x2-1; x++) {
1177 if (p<0) {
1178 p += dy2;
1179 } else {
1180 y += cpy;
1181 p += dy2-dx2;
1182 }
1183 i_ppix(im, x+1, y, val);
02d1d628 1184 }
aa833c97
AMH
1185 } else {
1186 int dy2, dx2, cpx;
1187
1188 /* sort bx y */
1189 if (y1 > y2) {
1190 int t;
1191 t = x1; x1 = x2; x2 = t;
1192 t = y1; y1 = y2; y2 = t;
1193 }
1194
1195 dy = abs(dy);
1196 dx = x2 - x1;
1197 dy2 = dy*2;
1198
1199 if (dx<0) {
1200 dx = -dx;
1201 cpx = -1;
1202 } else {
1203 cpx = 1;
1204 }
1205 dx2 = dx*2;
1206 p = dx2 - dy;
1207
1208 x = x1;
1209
1210 for(y=y1; y<y2-1; y++) {
1211 if (p<0) {
1212 p += dx2;
1213 } else {
1214 x += cpx;
1215 p += dx2-dy2;
1216 }
1217 i_ppix(im, x, y+1, val);
1218 }
1219 }
1220 if (endp) {
1221 i_ppix(im, x1, y1, val);
1222 i_ppix(im, x2, y2, val);
1223 } else {
1224 if (x1 != x2 || y1 != y2)
1225 i_ppix(im, x1, y1, val);
1226 }
02d1d628
AMH
1227}
1228
aa833c97 1229
02d1d628 1230void
b437ce0a
AMH
1231i_line_dda(i_img *im, int x1, int y1, int x2, int y2, i_color *val) {
1232
1233 float dy;
1234 int x;
1235
1236 for(x=x1; x<=x2; x++) {
1237 dy = y1+ (x-x1)/(float)(x2-x1)*(y2-y1);
135fb460 1238 i_ppix(im, x, (int)(dy+0.5), val);
b437ce0a
AMH
1239 }
1240}
1241
92bda632 1242/*
5715f7c3 1243=item i_line_aa(C<im>, C<x1>, C<x2>, C<y1>, C<y2>, C<color>, C<endp>)
92bda632
TC
1244
1245=category Drawing
1246
5715f7c3 1247Anti-alias draws a line from (x1,y1) to (x2, y2) in color.
b437ce0a 1248
5715f7c3 1249The point (x2, y2) is drawn only if C<endp> is set.
92bda632
TC
1250
1251=cut
1252*/
b437ce0a
AMH
1253
1254void
97ac0a96 1255i_line_aa(i_img *im, int x1, int y1, int x2, int y2, const i_color *val, int endp) {
b437ce0a
AMH
1256 int x, y;
1257 int dx, dy;
1258 int p;
b437ce0a
AMH
1259
1260 dx = x2 - x1;
1261 dy = y2 - y1;
1262
1263 /* choose variable to iterate on */
1264 if (abs(dx)>abs(dy)) {
1265 int dx2, dy2, cpy;
1266
1267 /* sort by x */
1268 if (x1 > x2) {
1269 int t;
1270 t = x1; x1 = x2; x2 = t;
1271 t = y1; y1 = y2; y2 = t;
1272 }
1273
1274 dx = abs(dx);
1275 dx2 = dx*2;
1276 dy = y2 - y1;
1277
1278 if (dy<0) {
1279 dy = -dy;
1280 cpy = -1;
1281 } else {
1282 cpy = 1;
1283 }
1284 dy2 = dy*2;
1285 p = dy2 - dx2; /* this has to be like this for AA */
1286
1287 y = y1;
1288
1289 for(x=x1; x<x2-1; x++) {
1290 int ch;
1291 i_color tval;
1292 float t = (dy) ? -(float)(p)/(float)(dx2) : 1;
1293 float t1, t2;
1294
1295 if (t<0) t = 0;
1296 t1 = 1-t;
1297 t2 = t;
1298
1299 i_gpix(im,x+1,y,&tval);
1300 for(ch=0;ch<im->channels;ch++)
1301 tval.channel[ch]=(unsigned char)(t1*(float)tval.channel[ch]+t2*(float)val->channel[ch]);
1302 i_ppix(im,x+1,y,&tval);
1303
1304 i_gpix(im,x+1,y+cpy,&tval);
1305 for(ch=0;ch<im->channels;ch++)
1306 tval.channel[ch]=(unsigned char)(t2*(float)tval.channel[ch]+t1*(float)val->channel[ch]);
1307 i_ppix(im,x+1,y+cpy,&tval);
1308
1309 if (p<0) {
1310 p += dy2;
1311 } else {
1312 y += cpy;
1313 p += dy2-dx2;
1314 }
1315 }
1316 } else {
1317 int dy2, dx2, cpx;
1318
1319 /* sort bx y */
1320 if (y1 > y2) {
1321 int t;
1322 t = x1; x1 = x2; x2 = t;
1323 t = y1; y1 = y2; y2 = t;
1324 }
1325
1326 dy = abs(dy);
1327 dx = x2 - x1;
1328 dy2 = dy*2;
1329
1330 if (dx<0) {
1331 dx = -dx;
1332 cpx = -1;
1333 } else {
1334 cpx = 1;
1335 }
1336 dx2 = dx*2;
1337 p = dx2 - dy2; /* this has to be like this for AA */
1338
1339 x = x1;
1340
1341 for(y=y1; y<y2-1; y++) {
1342 int ch;
1343 i_color tval;
1344 float t = (dx) ? -(float)(p)/(float)(dy2) : 1;
1345 float t1, t2;
1346
1347 if (t<0) t = 0;
1348 t1 = 1-t;
1349 t2 = t;
1350
1351 i_gpix(im,x,y+1,&tval);
1352 for(ch=0;ch<im->channels;ch++)
1353 tval.channel[ch]=(unsigned char)(t1*(float)tval.channel[ch]+t2*(float)val->channel[ch]);
1354 i_ppix(im,x,y+1,&tval);
1355
1356 i_gpix(im,x+cpx,y+1,&tval);
1357 for(ch=0;ch<im->channels;ch++)
1358 tval.channel[ch]=(unsigned char)(t2*(float)tval.channel[ch]+t1*(float)val->channel[ch]);
1359 i_ppix(im,x+cpx,y+1,&tval);
1360
1361 if (p<0) {
1362 p += dx2;
1363 } else {
1364 x += cpx;
1365 p += dx2-dy2;
1366 }
1367 }
1368 }
1369
1370
1371 if (endp) {
1372 i_ppix(im, x1, y1, val);
1373 i_ppix(im, x2, y2, val);
1374 } else {
1375 if (x1 != x2 || y1 != y2)
1376 i_ppix(im, x1, y1, val);
1377 }
1378}
1379
1380
1381
b33c08f8 1382static double
02d1d628
AMH
1383perm(int n,int k) {
1384 double r;
1385 int i;
1386 r=1;
1387 for(i=k+1;i<=n;i++) r*=i;
1388 for(i=1;i<=(n-k);i++) r/=i;
1389 return r;
1390}
1391
1392
1393/* Note in calculating t^k*(1-t)^(n-k)
1394 we can start by using t^0=1 so this simplifies to
1395 t^0*(1-t)^n - we want to multiply that with t/(1-t) each iteration
1396 to get a new level - this may lead to errors who knows lets test it */
1397
1398void
97ac0a96 1399i_bezier_multi(i_img *im,int l,const double *x,const double *y, const i_color *val) {
02d1d628
AMH
1400 double *bzcoef;
1401 double t,cx,cy;
1402 int k,i;
1403 int lx = 0,ly = 0;
1404 int n=l-1;
1405 double itr,ccoef;
1406
f0960b14
TC
1407 /* this is the same size as the x and y arrays, so shouldn't overflow */
1408 bzcoef=mymalloc(sizeof(double)*l); /* checked 5jul05 tonyc */
02d1d628
AMH
1409 for(k=0;k<l;k++) bzcoef[k]=perm(n,k);
1410 ICL_info(val);
1411
1412
1413 /* for(k=0;k<l;k++) printf("bzcoef: %d -> %f\n",k,bzcoef[k]); */
1414 i=0;
1415 for(t=0;t<=1;t+=0.005) {
1416 cx=cy=0;
1417 itr=t/(1-t);
1418 ccoef=pow(1-t,n);
1419 for(k=0;k<l;k++) {
1420 /* cx+=bzcoef[k]*x[k]*pow(t,k)*pow(1-t,n-k);
1421 cy+=bzcoef[k]*y[k]*pow(t,k)*pow(1-t,n-k);*/
1422
1423 cx+=bzcoef[k]*x[k]*ccoef;
1424 cy+=bzcoef[k]*y[k]*ccoef;
1425 ccoef*=itr;
1426 }
1427 /* printf("%f -> (%d,%d)\n",t,(int)(0.5+cx),(int)(0.5+cy)); */
1428 if (i++) {
b437ce0a 1429 i_line_aa(im,lx,ly,(int)(0.5+cx),(int)(0.5+cy),val, 1);
02d1d628
AMH
1430 }
1431 /* i_ppix(im,(int)(0.5+cx),(int)(0.5+cy),val); */
1432 lx=(int)(0.5+cx);
1433 ly=(int)(0.5+cy);
1434 }
1435 ICL_info(val);
1436 myfree(bzcoef);
1437}
1438
02d1d628
AMH
1439/* Flood fill
1440
1441 REF: Graphics Gems I. page 282+
1442
1443*/
1444
02d1d628
AMH
1445/* This should be moved into a seperate file? */
1446
1447/* This is the truncation used:
1448
1449 a double is multiplied by 16 and then truncated.
1450 This means that 0 -> 0
1451 So a triangle of (0,0) (10,10) (10,0) Will look like it's
1452 not filling the (10,10) point nor the (10,0)-(10,10) line segment
1453
1454*/
1455
1456
02d1d628
AMH
1457/* Flood fill algorithm - based on the Ken Fishkins (pixar) gem in
1458 graphics gems I */
1459
1460/*
1461struct stc {
1462 int mylx,myrx;
1463 int dadlx,dadrx;
1464 int myy;
1465 int mydirection;
1466};
1467
1468Not used code???
1469*/
1470
1471
1472struct stack_element {
1473 int myLx,myRx;
1474 int dadLx,dadRx;
1475 int myY;
1476 int myDirection;
1477};
1478
1479
1480/* create the link data to put push onto the stack */
1481
1482static
1483struct stack_element*
1484crdata(int left,int right,int dadl,int dadr,int y, int dir) {
1485 struct stack_element *ste;
f0960b14 1486 ste = mymalloc(sizeof(struct stack_element)); /* checked 5jul05 tonyc */
a73aeb5f
AMH
1487 ste->myLx = left;
1488 ste->myRx = right;
1489 ste->dadLx = dadl;
1490 ste->dadRx = dadr;
1491 ste->myY = y;
1492 ste->myDirection = dir;
02d1d628
AMH
1493 return ste;
1494}
1495
1496/* i_ccomp compares two colors and gives true if they are the same */
1497
3efb0915
TC
1498typedef int (*ff_cmpfunc)(i_color const *c1, i_color const *c2, int channels);
1499
02d1d628 1500static int
3efb0915 1501i_ccomp_normal(i_color const *val1, i_color const *val2, int ch) {
02d1d628 1502 int i;
3efb0915
TC
1503 for(i = 0; i < ch; i++)
1504 if (val1->channel[i] !=val2->channel[i])
1505 return 0;
02d1d628
AMH
1506 return 1;
1507}
1508
3efb0915
TC
1509static int
1510i_ccomp_border(i_color const *val1, i_color const *val2, int ch) {
1511 int i;
1512 for(i = 0; i < ch; i++)
1513 if (val1->channel[i] !=val2->channel[i])
1514 return 1;
1515 return 0;
1516}
02d1d628
AMH
1517
1518static int
3efb0915 1519i_lspan(i_img *im, int seedx, int seedy, i_color const *val, ff_cmpfunc cmpfunc) {
02d1d628
AMH
1520 i_color cval;
1521 while(1) {
1522 if (seedx-1 < 0) break;
1523 i_gpix(im,seedx-1,seedy,&cval);
3efb0915
TC
1524 if (!cmpfunc(val,&cval,im->channels))
1525 break;
02d1d628
AMH
1526 seedx--;
1527 }
1528 return seedx;
1529}
1530
1531static int
3efb0915 1532i_rspan(i_img *im, int seedx, int seedy, i_color const *val, ff_cmpfunc cmpfunc) {
02d1d628
AMH
1533 i_color cval;
1534 while(1) {
1535 if (seedx+1 > im->xsize-1) break;
1536 i_gpix(im,seedx+1,seedy,&cval);
3efb0915 1537 if (!cmpfunc(val,&cval,im->channels)) break;
02d1d628
AMH
1538 seedx++;
1539 }
1540 return seedx;
1541}
1542
1543/* Macro to create a link and push on to the list */
1544
e25e59b1
AMH
1545#define ST_PUSH(left,right,dadl,dadr,y,dir) do { \
1546 struct stack_element *s = crdata(left,right,dadl,dadr,y,dir); \
1547 llist_push(st,&s); \
1548} while (0)
02d1d628
AMH
1549
1550/* pops the shadow on TOS into local variables lx,rx,y,direction,dadLx and dadRx */
1551/* No overflow check! */
1552
e25e59b1
AMH
1553#define ST_POP() do { \
1554 struct stack_element *s; \
1555 llist_pop(st,&s); \
1556 lx = s->myLx; \
1557 rx = s->myRx; \
1558 dadLx = s->dadLx; \
1559 dadRx = s->dadRx; \
1560 y = s->myY; \
1561 direction = s->myDirection; \
1562 myfree(s); \
1563} while (0)
1564
1565#define ST_STACK(dir,dadLx,dadRx,lx,rx,y) do { \
1566 int pushrx = rx+1; \
1567 int pushlx = lx-1; \
1568 ST_PUSH(lx,rx,pushlx,pushrx,y+dir,dir); \
1569 if (rx > dadRx) \
1570 ST_PUSH(dadRx+1,rx,pushlx,pushrx,y-dir,-dir); \
1571 if (lx < dadLx) ST_PUSH(lx,dadLx-1,pushlx,pushrx,y-dir,-dir); \
1572} while (0)
1573
1574#define SET(x,y) btm_set(btm,x,y)
02d1d628 1575
86d20cb9 1576/* INSIDE returns true if pixel is correct color and we haven't set it before. */
3efb0915 1577#define INSIDE(x,y, seed) ((!btm_test(btm,x,y) && ( i_gpix(im,x,y,&cval),cmpfunc(seed,&cval,channels) ) ))
02d1d628 1578
02d1d628 1579
02d1d628 1580
aa833c97
AMH
1581/* The function that does all the real work */
1582
1583static struct i_bitmap *
1584i_flood_fill_low(i_img *im,int seedx,int seedy,
3efb0915
TC
1585 int *bxminp, int *bxmaxp, int *byminp, int *bymaxp,
1586 i_color const *seed, ff_cmpfunc cmpfunc) {
aa833c97
AMH
1587 int ltx, rtx;
1588 int tx = 0;
02d1d628 1589
e25e59b1
AMH
1590 int bxmin = seedx;
1591 int bxmax = seedx;
1592 int bymin = seedy;
1593 int bymax = seedy;
02d1d628
AMH
1594
1595 struct llist *st;
1596 struct i_bitmap *btm;
1597
1598 int channels,xsize,ysize;
3efb0915 1599 i_color cval;
02d1d628 1600
a73aeb5f
AMH
1601 channels = im->channels;
1602 xsize = im->xsize;
1603 ysize = im->ysize;
02d1d628 1604
86d20cb9
AMH
1605 btm = btm_new(xsize, ysize);
1606 st = llist_new(100, sizeof(struct stack_element*));
02d1d628 1607
02d1d628 1608 /* Find the starting span and fill it */
3efb0915
TC
1609 ltx = i_lspan(im, seedx, seedy, seed, cmpfunc);
1610 rtx = i_rspan(im, seedx, seedy, seed, cmpfunc);
aa833c97 1611 for(tx=ltx; tx<=rtx; tx++) SET(tx, seedy);
02d1d628 1612
aa833c97
AMH
1613 ST_PUSH(ltx, rtx, ltx, rtx, seedy+1, 1);
1614 ST_PUSH(ltx, rtx, ltx, rtx, seedy-1, -1);
02d1d628
AMH
1615
1616 while(st->count) {
aa833c97
AMH
1617 /* Stack variables */
1618 int lx,rx;
1619 int dadLx,dadRx;
1620 int y;
1621 int direction;
e25e59b1 1622
aa833c97
AMH
1623 int x;
1624 int wasIn=0;
02d1d628 1625
aa833c97
AMH
1626 ST_POP(); /* sets lx, rx, dadLx, dadRx, y, direction */
1627
1628
1629 if (y<0 || y>ysize-1) continue;
02d1d628
AMH
1630 if (bymin > y) bymin=y; /* in the worst case an extra line */
1631 if (bymax < y) bymax=y;
1632
e25e59b1
AMH
1633
1634 x = lx+1;
3efb0915 1635 if ( lx >= 0 && (wasIn = INSIDE(lx, y, seed)) ) {
aa833c97 1636 SET(lx, y);
02d1d628 1637 lx--;
3efb0915 1638 while(INSIDE(lx, y, seed) && lx > 0) {
02d1d628
AMH
1639 SET(lx,y);
1640 lx--;
1641 }
1642 }
1643
86d20cb9 1644 if (bxmin > lx) bxmin = lx;
02d1d628
AMH
1645 while(x <= xsize-1) {
1646 /* printf("x=%d\n",x); */
1647 if (wasIn) {
1648
3efb0915 1649 if (INSIDE(x, y, seed)) {
02d1d628
AMH
1650 /* case 1: was inside, am still inside */
1651 SET(x,y);
1652 } else {
1653 /* case 2: was inside, am no longer inside: just found the
1654 right edge of a span */
aa833c97 1655 ST_STACK(direction, dadLx, dadRx, lx, (x-1), y);
02d1d628 1656
aa833c97 1657 if (bxmax < x) bxmax = x;
02d1d628
AMH
1658 wasIn=0;
1659 }
1660 } else {
aa833c97 1661 if (x > rx) goto EXT;
3efb0915 1662 if (INSIDE(x, y, seed)) {
aa833c97 1663 SET(x, y);
02d1d628 1664 /* case 3: Wasn't inside, am now: just found the start of a new run */
aa833c97
AMH
1665 wasIn = 1;
1666 lx = x;
02d1d628
AMH
1667 } else {
1668 /* case 4: Wasn't inside, still isn't */
1669 }
1670 }
1671 x++;
1672 }
1673 EXT: /* out of loop */
1674 if (wasIn) {
1675 /* hit an edge of the frame buffer while inside a run */
aa833c97
AMH
1676 ST_STACK(direction, dadLx, dadRx, lx, (x-1), y);
1677 if (bxmax < x) bxmax = x;
02d1d628
AMH
1678 }
1679 }
02d1d628 1680
02d1d628 1681 llist_destroy(st);
cc6483e0 1682
aa833c97
AMH
1683 *bxminp = bxmin;
1684 *bxmaxp = bxmax;
1685 *byminp = bymin;
1686 *bymaxp = bymax;
cc6483e0 1687
aa833c97
AMH
1688 return btm;
1689}
cc6483e0 1690
92bda632 1691/*
5715f7c3 1692=item i_flood_fill(C<im>, C<seedx>, C<seedy>, C<color>)
92bda632
TC
1693
1694=category Drawing
1695=synopsis i_flood_fill(im, 50, 50, &color);
cc6483e0 1696
5715f7c3
TC
1697Flood fills the 4-connected region starting from the point (C<seedx>,
1698C<seedy>) with I<color>.
cc6483e0 1699
5715f7c3 1700Returns false if (C<seedx>, C<seedy>) are outside the image.
92bda632
TC
1701
1702=cut
1703*/
cc6483e0 1704
aa833c97 1705undef_int
97ac0a96 1706i_flood_fill(i_img *im, int seedx, int seedy, const i_color *dcol) {
aa833c97
AMH
1707 int bxmin, bxmax, bymin, bymax;
1708 struct i_bitmap *btm;
1709 int x, y;
3efb0915 1710 i_color val;
cc6483e0 1711
aa833c97
AMH
1712 i_clear_error();
1713 if (seedx < 0 || seedx >= im->xsize ||
1714 seedy < 0 || seedy >= im->ysize) {
1715 i_push_error(0, "i_flood_cfill: Seed pixel outside of image");
1716 return 0;
cc6483e0 1717 }
cc6483e0 1718
3efb0915
TC
1719 /* Get the reference color */
1720 i_gpix(im, seedx, seedy, &val);
1721
1722 btm = i_flood_fill_low(im, seedx, seedy, &bxmin, &bxmax, &bymin, &bymax,
1723 &val, i_ccomp_normal);
cc6483e0 1724
aa833c97
AMH
1725 for(y=bymin;y<=bymax;y++)
1726 for(x=bxmin;x<=bxmax;x++)
1727 if (btm_test(btm,x,y))
1728 i_ppix(im,x,y,dcol);
1729 btm_destroy(btm);
1730 return 1;
cc6483e0
TC
1731}
1732
92bda632 1733/*
5715f7c3 1734=item i_flood_cfill(C<im>, C<seedx>, C<seedy>, C<fill>)
92bda632
TC
1735
1736=category Drawing
1737=synopsis i_flood_cfill(im, 50, 50, fill);
aa833c97 1738
5715f7c3
TC
1739Flood fills the 4-connected region starting from the point (C<seedx>,
1740C<seedy>) with C<fill>.
92bda632 1741
5715f7c3 1742Returns false if (C<seedx>, C<seedy>) are outside the image.
92bda632
TC
1743
1744=cut
1745*/
aa833c97 1746
a321d497 1747undef_int
cc6483e0
TC
1748i_flood_cfill(i_img *im, int seedx, int seedy, i_fill_t *fill) {
1749 int bxmin, bxmax, bymin, bymax;
1750 struct i_bitmap *btm;
3efb0915 1751 i_color val;
cc6483e0 1752
aa833c97 1753 i_clear_error();
a321d497
AMH
1754
1755 if (seedx < 0 || seedx >= im->xsize ||
1756 seedy < 0 || seedy >= im->ysize) {
3e1e2ed3 1757 i_push_error(0, "i_flood_cfill: Seed pixel outside of image");
a321d497
AMH
1758 return 0;
1759 }
1760
3efb0915
TC
1761 /* Get the reference color */
1762 i_gpix(im, seedx, seedy, &val);
1763
1764 btm = i_flood_fill_low(im, seedx, seedy, &bxmin, &bxmax, &bymin, &bymax,
1765 &val, i_ccomp_normal);
1766
1767 cfill_from_btm(im, fill, btm, bxmin, bxmax, bymin, bymax);
1768
1769 btm_destroy(btm);
1770 return 1;
1771}
1772
1773/*
5715f7c3 1774=item i_flood_fill_border(C<im>, C<seedx>, C<seedy>, C<color>, C<border>)
3efb0915
TC
1775
1776=category Drawing
1777=synopsis i_flood_fill_border(im, 50, 50, &color, &border);
1778
5715f7c3
TC
1779Flood fills the 4-connected region starting from the point (C<seedx>,
1780C<seedy>) with C<color>, fill stops when the fill reaches a pixels
1781with color C<border>.
3efb0915 1782
5715f7c3 1783Returns false if (C<seedx>, C<seedy>) are outside the image.
3efb0915
TC
1784
1785=cut
1786*/
1787
1788undef_int
1789i_flood_fill_border(i_img *im, int seedx, int seedy, const i_color *dcol,
1790 const i_color *border) {
1791 int bxmin, bxmax, bymin, bymax;
1792 struct i_bitmap *btm;
1793 int x, y;
1794
1795 i_clear_error();
1796 if (seedx < 0 || seedx >= im->xsize ||
1797 seedy < 0 || seedy >= im->ysize) {
1798 i_push_error(0, "i_flood_cfill: Seed pixel outside of image");
1799 return 0;
1800 }
1801
1802 btm = i_flood_fill_low(im, seedx, seedy, &bxmin, &bxmax, &bymin, &bymax,
1803 border, i_ccomp_border);
1804
1805 for(y=bymin;y<=bymax;y++)
1806 for(x=bxmin;x<=bxmax;x++)
1807 if (btm_test(btm,x,y))
1808 i_ppix(im,x,y,dcol);
1809 btm_destroy(btm);
1810 return 1;
1811}
1812
1813/*
5715f7c3 1814=item i_flood_cfill_border(C<im>, C<seedx>, C<seedy>, C<fill>, C<border>)
3efb0915
TC
1815
1816=category Drawing
1817=synopsis i_flood_cfill_border(im, 50, 50, fill, border);
1818
5715f7c3
TC
1819Flood fills the 4-connected region starting from the point (C<seedx>,
1820C<seedy>) with C<fill>, the fill stops when it reaches pixels of color
1821C<border>.
3efb0915 1822
5715f7c3 1823Returns false if (C<seedx>, C<seedy>) are outside the image.
3efb0915
TC
1824
1825=cut
1826*/
1827
1828undef_int
1829i_flood_cfill_border(i_img *im, int seedx, int seedy, i_fill_t *fill,
1830 const i_color *border) {
1831 int bxmin, bxmax, bymin, bymax;
1832 struct i_bitmap *btm;
1833
1834 i_clear_error();
1835
1836 if (seedx < 0 || seedx >= im->xsize ||
1837 seedy < 0 || seedy >= im->ysize) {
1838 i_push_error(0, "i_flood_cfill_border: Seed pixel outside of image");
1839 return 0;
1840 }
1841
1842 btm = i_flood_fill_low(im, seedx, seedy, &bxmin, &bxmax, &bymin, &bymax,
1843 border, i_ccomp_border);
1844
1845 cfill_from_btm(im, fill, btm, bxmin, bxmax, bymin, bymax);
1846
1847 btm_destroy(btm);
1848
1849 return 1;
1850}
1851
1852static void
1853cfill_from_btm(i_img *im, i_fill_t *fill, struct i_bitmap *btm,
1854 int bxmin, int bxmax, int bymin, int bymax) {
1855 int x, y;
1856 int start;
cc6483e0 1857
9b1ec2b8
TC
1858 i_render r;
1859
1860 i_render_init(&r, im, bxmax - bxmin + 1);
1861
1862 for(y=bymin; y<=bymax; y++) {
1863 x = bxmin;
1864 while (x <= bxmax) {
1865 while (x <= bxmax && !btm_test(btm, x, y)) {
1866 ++x;
cc6483e0 1867 }
9b1ec2b8
TC
1868 if (btm_test(btm, x, y)) {
1869 start = x;
1870 while (x <= bxmax && btm_test(btm, x, y)) {
1871 ++x;
1872 }
1873 i_render_fill(&r, start, y, x-start, NULL, fill);
cc6483e0
TC
1874 }
1875 }
cc6483e0 1876 }
9b1ec2b8 1877 i_render_done(&r);
cc6483e0 1878}