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
|
#include <stdlib.h>
#include <math.h>
#include <grass/gis.h>
#include "driver.h"
#include "driverlib.h"
struct point
{
int x, y;
};
static int cmp_int(const void *aa, const void *bb)
{
const int *a = aa;
const int *b = bb;
return *a - *b;
}
static void fill(int x0, int x1, int y)
{
COM_Box_abs(x0, y, x1, y + 1);
}
static void line(const struct point *p, int n, int y)
{
static int *xs;
static int max_x;
int num_x = 0;
int i;
for (i = 0; i < n; i++) {
const struct point *p0 = &p[i];
const struct point *p1 = &p[i + 1];
const struct point *tmp;
double fx, fy;
long x;
if (p0->y == p1->y)
continue;
if (p0->y > p1->y)
tmp = p0, p0 = p1, p1 = tmp;
if (p0->y > y)
continue;
if (p1->y <= y)
continue;
fy = y + 0.5;
fx = (double)p1->x * (fy - p0->y) + (double)p0->x * (p1->y - fy);
fx /= p1->y - p0->y;
x = fx < -0x7fffffff ? -0x7fffffff :
fx > 0x7fffffff ? 0x7fffffff : (long)floor(fx + 0.5);
if (num_x >= max_x) {
max_x += 20;
xs = G_realloc(xs, max_x * sizeof(int));
}
xs[num_x++] = x;
}
qsort(xs, num_x, sizeof(int), cmp_int);
for (i = 0; i + 1 < num_x; i += 2)
fill(xs[i], xs[i + 1], y);
}
static void poly(const struct point *p, int n)
{
int y0, y1;
int i, y;
if (n < 3)
return;
y0 = y1 = p[0].y;
for (i = 1; i < n; i++) {
if (y0 > p[i].y)
y0 = p[i].y;
if (y1 < p[i].y)
y1 = p[i].y;
}
if (y0 > screen_bottom || y1 < screen_top)
return;
if (y0 < screen_top)
y0 = screen_top;
if (y1 > screen_bottom)
y1 = screen_bottom;
for (y = y0; y < y1; y++)
line(p, n, y);
}
static void fill_polygon(const int *xarray, const int *yarray, int count)
{
static struct point *points;
static int max_points;
int i;
if (max_points < count + 1) {
max_points = count + 1;
points = G_realloc(points, sizeof(struct point) * max_points);
}
for (i = 0; i < count; i++) {
points[i].x = xarray[i];
points[i].y = yarray[i];
}
points[count].x = xarray[0];
points[count].y = yarray[0];
poly(points, count);
}
void COM_Polygon_abs(const int *xarray, const int *yarray, int number)
{
if (driver->Polygon_abs) {
(*driver->Polygon_abs) (xarray, yarray, number);
return;
}
fill_polygon(xarray, yarray, number);
}
void COM_Polygon_rel(const int *xarray, const int *yarray, int number)
{
static int *xa, *ya;
static int nalloc;
int i;
if (driver->Polygon_rel) {
(*driver->Polygon_rel) (xarray, yarray, number);
return;
}
if (number > nalloc) {
nalloc = number;
xa = G_realloc(xa, (size_t) nalloc * sizeof(int));
ya = G_realloc(ya, (size_t) nalloc * sizeof(int));
}
xa[0] = xarray[0] + cur_x;
ya[0] = yarray[0] + cur_y;
for (i = 1; i < number; i++) {
xa[i] = xa[i - 1] + xarray[i];
ya[i] = ya[i - 1] + yarray[i];
}
COM_Polygon_abs(xa, ya, number);
}
|
