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
|
/****************************************************************
* I_cluster_point (C,x)
* struct Cluster *C;
* DCELL *x;
*
* adds the point x to the list of data points to be "clustered"
*
* returns
* 0 ok
* -1 out of memory, point not added
* 1 all values are zero, point not added
*
* the dimension of x must agree with the number of bands specified
* in the initializing call to I_cluster_begin()
*
* note: if all values in x are zero, the point is rejected
***************************************************************/
#include <grass/cluster.h>
static int extend(struct Cluster *, int);
static int all_zero(struct Cluster *, int);
int I_cluster_point(struct Cluster *C, DCELL * x)
{
int band;
/* reject points which contain nulls in one of the bands */
for (band = 0; band < C->nbands; band++)
if (G_is_d_null_value(&x[band]))
return 1; /* fixed 11/99 Agus Carr */
/*
if (band >= C->nbands)
return 1;
*/
/* extend the arrays for each band, if necessary */
if (!extend(C, 1))
return -1;
/* add the point to the points arrays */
for (band = 0; band < C->nbands; band++) {
register double z;
/* if(G_is_d_null_value(&x[band])) continue; */
z = C->points[band][C->npoints] = x[band];
C->band_sum[band] += z;
C->band_sum2[band] += z * z;
}
C->npoints++;
return 0;
}
int I_cluster_begin_point_set(struct Cluster *C, int n)
{
return extend(C, n) ? 0 : -1;
}
int I_cluster_point_part(struct Cluster *C, DCELL x, int band, int n)
{
DCELL tmp = x;
if (G_is_d_null_value(&tmp))
return 1;
C->points[band][C->npoints + n] = x;
C->band_sum[band] += x;
C->band_sum2[band] += x * x;
return 0;
}
int I_cluster_end_point_set(struct Cluster *C, int n)
{
int band;
int cur, next;
cur = C->npoints;
n += C->npoints;
for (next = cur; next < n; next++) {
if (!all_zero(C, next)) {
if (cur != next)
for (band = 0; band < C->nbands; band++)
C->points[band][cur] = C->points[band][next];
cur++;
}
}
return C->npoints = cur;
}
static int all_zero(struct Cluster *C, int i)
{
int band;
for (band = 0; band < C->nbands; band++)
if (C->points[band][i])
return 0;
return 1;
}
static int extend(struct Cluster *C, int n)
{
int band;
while ((C->npoints + n) > C->np) {
C->np += 128;
for (band = 0; band < C->nbands; band++) {
C->points[band] =
(DCELL *) I_realloc(C->points[band], C->np * sizeof(DCELL));
if (C->points[band] == NULL)
return 0;
}
}
return 1;
}
|
