1
/* Libart_LGPL - library of basic graphic primitives
2
* Copyright (C) 1998-2000 Raph Levien
4
* This library is free software; you can redistribute it and/or
5
* modify it under the terms of the GNU Library General Public
6
* License as published by the Free Software Foundation; either
7
* version 3 of the License, or (at your option) any later version.
9
* This library is distributed in the hope that it will be useful,
10
* but WITHOUT ANY WARRANTY; without even the implied warranty of
11
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12
* Library General Public License for more details.
14
* You should have received a copy of the GNU Library General Public
15
* License along with this library; if not, see <http://www.gnu.org/licenses/>.
16
* Boston, MA 02111-1307, USA.
20
#include "art_uta_ops.h"
27
#define MIN(a,b) ((a) < (b) ? (a) : (b))
31
#define MAX(a,b) ((a) > (b) ? (a) : (b))
35
* art_uta_union: Compute union of two uta's.
37
* @uta2: The other uta.
39
* Computes the union of @uta1 and @uta2. The union is approximate,
40
* but coverage is guaranteed over all pixels included in either of
41
* the arguments, ie more pixels may be covered than the "exact"
44
* Note: this routine is used in the Gnome Canvas to accumulate the
45
* region that needs to be repainted. However, since it copies over
46
* the entire uta (which might be largish) even when the update may be
47
* small, it can be a performance bottleneck. There are two approaches
48
* to this problem, both of which are probably worthwhile. First, the
49
* generated uta's should always be limited to the visible window,
50
* thus guaranteeing that uta's never become large. Second, there
51
* should be a new, destructive union operation that only touches a
52
* small part of the uta when the update is small.
54
* Return value: The new union uta.
57
art_uta_union (ArtUta *uta1, ArtUta *uta2)
63
ArtUtaBbox bb, bb1, bb2;
65
x0 = MIN(uta1->x0, uta2->x0);
66
y0 = MIN(uta1->y0, uta2->y0);
67
x1 = MAX(uta1->x0 + uta1->width, uta2->x0 + uta2->width);
68
y1 = MAX(uta1->y0 + uta1->height, uta2->y0 + uta2->height);
69
uta = art_uta_new (x0, y0, x1, y1);
71
/* could move the first two if/else statements out of the loop */
73
for (y = y0; y < y1; y++)
75
ix1 = (y - uta1->y0) * uta1->width + x0 - uta1->x0;
76
ix2 = (y - uta2->y0) * uta2->width + x0 - uta2->x0;
77
for (x = x0; x < x1; x++)
79
if (x < uta1->x0 || y < uta1->y0 ||
80
x >= uta1->x0 + uta1->width || y >= uta1->y0 + uta1->height)
83
bb1 = uta1->utiles[ix1];
85
if (x < uta2->x0 || y < uta2->y0 ||
86
x >= uta2->x0 + uta2->width || y >= uta2->y0 + uta2->height)
89
bb2 = uta2->utiles[ix2];
96
bb = ART_UTA_BBOX_CONS(MIN(ART_UTA_BBOX_X0(bb1),
97
ART_UTA_BBOX_X0(bb2)),
98
MIN(ART_UTA_BBOX_Y0(bb1),
99
ART_UTA_BBOX_Y0(bb2)),
100
MAX(ART_UTA_BBOX_X1(bb1),
101
ART_UTA_BBOX_X1(bb2)),
102
MAX(ART_UTA_BBOX_Y1(bb1),
103
ART_UTA_BBOX_Y1(bb2)));
104
uta->utiles[ix] = bb;