Newer
Older
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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
#include "adssub.h"
#include <math.h>
double Pi() {
return 2*acos(0);
}
void progress(int i,int *l, int max) {
int nb=20;
int p=i*(nb+1)/max;
int j;
if(p>*l){
for(j=*l;j<p;j++) {
if(j==nb) {
Rprintf("ok\n");
}
else {
Rprintf(".");
}
}
*l=p;
}
}
/*double alea () {
double w;
w = ((double) rand())/ (double)RAND_MAX;
return (w);
}*/
/***********************************************************************/
/*--------------------------------------------------
* liberation de memoire pour un vecteur
--------------------------------------------------*/
void freeintvec (int *vec) {
free((char *) vec);
}
/*--------------------------------------------------
* Allocation de memoire dynamique pour un tableau (l1, c1)
--------------------------------------------------*/
void freetab (double **tab) {
int i, n;
n = *(*(tab));
for (i=0;i<=n;i++) {
free((char *) *(tab+i) );
}
free((char *) tab);
}
/*--------------------------------------------------
* liberation de memoire pour un vecteur
--------------------------------------------------*/
void freevec (double *vec) {
free((char *) vec);
}
/*--------------------------------------------------
* Allocation de memoire dynamique pour un tableau (l1, c1)
--------------------------------------------------*/
void taballoc (double ***tab, int l1, int c1) {
int i, j;
if ( (*tab = (double **) calloc(l1+1, sizeof(double *))) != 0) {
for (i=0;i<=l1;i++) {
if ( (*(*tab+i)=(double *) calloc(c1+1, sizeof(double))) == 0 ) {
return;
for (j=0;j<i;j++) {
free(*(*tab+j));
}
}
}
}
**(*tab) = l1;
**(*tab+1) = c1;
}
/*--------------------------------------------------
* Allocation de memoire dynamique pour un tableau
* d'entiers (l1, c1)
--------------------------------------------------*/
void tabintalloc (int ***tab, int l1, int c1) {
int i, j;
*tab = (int **) calloc(l1+1, sizeof(int *));
if ( *tab != NULL) {
for (i=0;i<=l1;i++) {
*(*tab+i)=(int *) calloc(c1+1, sizeof(int));
if ( *(*tab+i) == NULL ) {
for (j=0;j<i;j++) {
free(*(*tab+j));
}
return;
}
}
} else return;
**(*tab) = l1;
**(*tab+1) = c1;
for (i=1;i<=l1;i++) {
for (j=1;j<=c1;j++) {
(*tab)[i][j] = 0;
}
}
}
/*--------------------------------------------------
* Allocation de memoire dynamique pour un tableau
--------------------------------------------------*/
void freeinttab (int **tab) {
int i, n;
n = *(*(tab));
for (i=0;i<=n;i++) {
free((char *) *(tab+i) );
}
free((char *) tab);
}
/*--------------------------------------------------
* Allocation de memoire pour un vecteur de longueur n
--------------------------------------------------*/
void vecalloc (double **vec, int n) {
if ( (*vec = (double *) calloc(n+1, sizeof(double))) != 0) {
**vec = n;
return;
} else {
return;
}
}
/*--------------------------------------------------
* Allocation de memoire pour un vecteur d'entiers de longueur n
--------------------------------------------------*/
void vecintalloc (int **vec, int n) {
if ( (*vec = (int *) calloc(n+1, sizeof(int))) != NULL) {
**vec = n;
return;
} else {
return;
}
}
/*pour les triangles a exclure*/
double bacos(double a) {
double b;
if (a>=1)
b=0;
else if (a<=-1)
b=Pi();
else
b=acos(a);
return b;
}
/*Decale les valeurs de v de la valeur val*/
void decalVal(double *v, int n, double val) {
int i;
for(i=0;i<n;i++) {
v[i]=v[i]+val;
}
}
/*Decale les points et la fenetre rectangulaire*/
void decalRect(int point_nb,double *x, double *y,double *xmin, double *xmax, double *ymin, double *ymax) {
if(*xmin<0) {
decalVal(x,point_nb,-*xmin);
*xmax=*xmax-*xmin;
*xmin=0;
}
if(*ymin<0) {
decalVal(y,point_nb,-*ymin);
*ymax=*ymax-*ymin;
*ymin=0;
}
}
/*Decale les points et la fenetre circulaire*/
void decalCirc(int point_nb,double *x, double *y,double *x0, double *y0, double r0) {
int xmin=*x0-r0;
int ymin=*y0-r0;
if(xmin<0) {
decalVal(x,point_nb,-xmin);
*x0=*x0-xmin;
}
if(ymin<0) {
decalVal(y,point_nb,-ymin);
*y0=*y0-ymin;
}
}
/*Decale les points et la fenetre rectangulaire + triangles*/
void decalRectTri(int point_nb,double *x, double *y,double *xmin, double *xmax, double *ymin, double *ymax,
int tri_nb,double *ax, double *ay, double *bx, double *by, double *cx, double *cy) {
if(*xmin<0) {
decalVal(x,point_nb,-*xmin);
decalVal(ax,tri_nb,-*xmin);
decalVal(bx,tri_nb,-*xmin);
decalVal(cx,tri_nb,-*xmin);
*xmax=*xmax-*xmin;
*xmin=0;
}
if(*ymin<0) {
decalVal(y,point_nb,-*ymin);
decalVal(ay,tri_nb,-*ymin);
decalVal(by,tri_nb,-*ymin);
decalVal(cy,tri_nb,-*ymin);
*ymax=*ymax-*ymin;
*ymin=0;
}
}
/*Decale les points et la fenetre circulaire + triangles*/
void decalCircTri(int point_nb,double *x, double *y,double *x0, double *y0, double r0,
int tri_nb,double *ax, double *ay, double *bx, double *by, double *cx, double *cy) {
int xmin=*x0-r0;
int ymin=*y0-r0;
if(xmin<0) {
decalVal(x,point_nb,-xmin);
decalVal(ax,tri_nb,-xmin);
decalVal(bx,tri_nb,-xmin);
decalVal(cx,tri_nb,-xmin);
*x0=*x0-xmin;
}
if(ymin<0) {
decalVal(y,point_nb,-ymin);
decalVal(ay,tri_nb,-ymin);
decalVal(by,tri_nb,-ymin);
decalVal(cy,tri_nb,-ymin);
*y0=*y0-ymin;
}
}
/*Decale les points et la fenetre rectangulaire (semis bivarie)*/
void decalRect2(int point_nb1,double *x1, double *y1,int point_nb2,double *x2, double *y2,
double *xmin, double *xmax, double *ymin, double *ymax) {
if(*xmin<0) {
decalVal(x1,point_nb1,-*xmin);
decalVal(x2,point_nb2,-*xmin);
*xmax=*xmax-*xmin;
*xmin=0;
}
if(*ymin<0) {
decalVal(y1,point_nb1,-*ymin);
decalVal(y2,point_nb2,-*ymin);
*ymax=*ymax-*ymin;
*ymin=0;
}
}
/*Decale les points et la fenetre circulaire (semis bivarie)*/
void decalCirc2(int point_nb1,double *x1, double *y1,int point_nb2,double *x2, double *y2,
double *x0, double *y0, double r0) {
int xmin=*x0-r0;
int ymin=*y0-r0;
if(xmin<0) {
decalVal(x1,point_nb1,-xmin);
decalVal(x2,point_nb2,-xmin);
*x0=*x0-xmin;
}
if(ymin<0) {
decalVal(y1,point_nb1,-ymin);
decalVal(y2,point_nb2,-ymin);
*y0=*y0-ymin;
}
}
/*Decale les points et la fenetre rectangulaire + triangles (semis bivarie)*/
void decalRectTri2(int point_nb1,double *x1, double *y1,int point_nb2,double *x2, double *y2,
double *xmin, double *xmax, double *ymin, double *ymax,
int tri_nb,double *ax, double *ay, double *bx, double *by, double *cx, double *cy) {
if(*xmin<0) {
decalVal(x1,point_nb1,-*xmin);
decalVal(x2,point_nb2,-*xmin);
decalVal(ax,tri_nb,-*xmin);
decalVal(bx,tri_nb,-*xmin);
decalVal(cx,tri_nb,-*xmin);
*xmax=*xmax-*xmin;
*xmin=0;
}
if(*ymin<0) {
decalVal(y1,point_nb1,-*ymin);
decalVal(y2,point_nb2,-*ymin);
decalVal(ay,tri_nb,-*ymin);
decalVal(by,tri_nb,-*ymin);
decalVal(cy,tri_nb,-*ymin);
*ymax=*ymax-*ymin;
*ymin=0;
}
}
/*Decale les points et la fenetre circulaire + triangles (semis bivarie)*/
void decalCircTri2(int point_nb1,double *x1, double *y1,int point_nb2,double *x2, double *y2,
double *x0, double *y0, double r0,
int tri_nb,double *ax, double *ay, double *bx, double *by, double *cx, double *cy) {
int xmin=*x0-r0;
int ymin=*y0-r0;
if(xmin<0) {
decalVal(x1,point_nb1,-xmin);
decalVal(x2,point_nb2,-xmin);
decalVal(ax,tri_nb,-xmin);
decalVal(bx,tri_nb,-xmin);
decalVal(cx,tri_nb,-xmin);
*x0=*x0-xmin;
}
if(ymin<0) {
decalVal(y1,point_nb1,-ymin);
decalVal(y2,point_nb2,-ymin);
decalVal(ay,tri_nb,-ymin);
decalVal(by,tri_nb,-ymin);
decalVal(cy,tri_nb,-ymin);
*y0=*y0-ymin;
}
}
/*Decale les points d'echantillonnages (pour density)*/
void decalSample(int sample_nb,double *x, double *y, double xmin, double ymin) {
if(xmin<0) {
decalVal(x,sample_nb,-xmin);
}
if(ymin<0) {
decalVal(y,sample_nb,-ymin);
}
}
/*memory allocation for a table with variable row length*/
double** taballoca(int a,int *b)
{
double **t;
int i;
t = (double ** ) malloc (a * sizeof (double*));
for (i=0;i<a;i++)
{
t[i]=(double *)malloc(b[i+1] * a * sizeof(double));
}
return t;
}
/*create a table with variable row length*/
void complete_tab(int point_nb,double **xx,double **yy,int *type,int *compt,int *l, double *x,double *y){
int i;
for(i=0;i<point_nb;i++)
{
xx[type[i]-1][compt[type[i]]]=x[i];
yy[type[i]-1][compt[type[i]]]=y[i];
//Rprintf("%d,%d ::: %f, %f\n",type[i]-1,compt[type[i]],x[i],y[i]);
compt[type[i]]++;
}
return ;
}