2 #include <grass/cluster.h>
16 for (p = 0; p < C->npoints; p++) {
22 for (c = 0; c < C->nclasses; c++) {
24 for (band = 0; band < C->nbands; band++) {
25 q = C->points[band][p];
26 q -= C->mean[band][c];
29 if (c == 0 || d < dmin) {
36 for (band = 0; band < C->nbands; band++)
37 C->sum[band][
class] += C->points[band][p];
int I_cluster_assign(struct Cluster *C, int *interrupted)
#define HUGE_VAL
Values needed for Ray-Convex Polyhedron Intersection Test below originally by Eric Haines...