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
|
/* Scicos
*
* Copyright (C) INRIA - METALAU Project <scicos@inria.fr>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* See the file ./license.txt
*/
/*--------------------------------------------------------------------------*/
#include <math.h>
#include "scicos_block4.h"
#include "scicos_indexfinder.h"
#include "MALLOC.h"
#include "dynlib_scicos_blocks.h"
/*--------------------------------------------------------------------------*/
#define InterpExtrapBlin 1
#define InterpEndValue 2
#define InputNearest 3
#define InputBelow 4
#define InputAbove 5
#define InterpExtraplin 6
/*--------------------------------------------------------------------------*/
double computeZ2(double *X, double *Y, double *Z, int nx, int ny, int method, double x, double y);
/*--------------------------------------------------------------------------*/
SCICOS_BLOCKS_IMPEXP void lookup2d(scicos_block *block, int flag)
{
double *y = NULL, *u1 = NULL, *u2 = NULL;
double *X = NULL, *Y = NULL, *Z = NULL;
int Nx = block->ipar[0];
int Ny = block->ipar[1];
int method = block->ipar[2];
X = block->rpar;
Y = X + Nx;
Z = Y + Ny;
switch (flag)
{
/* init */
case 4 :
case 1 :
u1 = GetRealInPortPtrs(block, 1);
u2 = GetRealInPortPtrs(block, 2);
y = GetRealOutPortPtrs(block, 1);
y[0] = computeZ2(X, Y, Z, Nx, Ny, method, u1[0], u2[0]);
break;
case 3 :
case 5 :
default :
break;
}
}
/*--------------------------------------------------------------------------*/
double computeZ2(double *X, double *Y, double *Z, int nx, int ny, int method, double x, double y)
{
int i = 0, j = 0, im = 0, jm = 0;
double fq11 = 0., fq12 = 0., fq21 = 0., fq22 = 0., w = 0., w1 = 0., w2 = 0., z = 0.;
double x1 = 0., x2 = 0., x3 = 0., y1 = 0., y2 = 0., y3 = 0., z1 = 0., z2 = 0., z3 = 0., A = 0., B = 0., C = 0., D = 0.;
i = scicos_indexfinder(x, nx, X);
j = scicos_indexfinder(y, ny, Y);
if (method == InputNearest)
{
if ((X[i] - x) > (x - X[i - 1]))
{
i = i - 1;
}
if ((Y[j] - y) > (y - Y[j - 1]))
{
j = j - 1;
}
z = Z[i + j * nx];
}
else if (method == InputBelow)
{
im = i - 1;
jm = j - 1;
z = Z[im + jm * nx];
}
else if (method == InputAbove)
{
z = Z[i + j * nx];
}
else if (method == InterpEndValue)
{
if (x >= X[nx - 1])
{
x = X[nx - 1];
}
else if (x <= X[0])
{
x = X[0];
};
if (y >= Y[ny - 1])
{
y = Y[ny - 1];
}
else if (y <= Y[0])
{
y = Y[0];
};
im = i - 1;
jm = j - 1;
fq11 = Z[im + jm * nx];
fq21 = Z[i + jm * nx];
fq12 = Z[im + j * nx];
fq22 = Z[i + j * nx];
w = (X[i] - X[im]) * (Y[j] - Y[jm]);
w1 = (fq11 * (X[i] - x) + fq21 * (x - X[im])) * (Y[j] - y);
w2 = (fq12 * (X[i] - x) + fq22 * (x - X[im])) * (y - Y[jm]);
z = (w1 + w2) / w;
}
else if (method == InterpExtrapBlin)
{
im = i - 1;
jm = j - 1;
fq11 = Z[im + jm * nx];
fq21 = Z[i + jm * nx];
fq12 = Z[im + j * nx];
fq22 = Z[i + j * nx];
w = (X[i] - X[im]) * (Y[j] - Y[jm]);
w1 = (fq11 * (X[i] - x) + fq21 * (x - X[im])) * (Y[j] - y);
w2 = (fq12 * (X[i] - x) + fq22 * (x - X[im])) * (y - Y[jm]);
z = (w1 + w2) / w;
}
else if (method == InterpExtraplin) /* triangulation*/
{
/*
If the linear interpolation scheme is selected, the 2D points
are first triangulated. It is a network of triangles connecting
the points together. It is used to interpolate. The equation of
the plane defined by the three vertices of a triangle is as
follows: Ax+By+Cz+D=0; where A, B, and C, and D are computed
from the coordinates of the three vertices (x1,y1,z1),
(x2,y2,z2), & (x3,y3,z3). which is the form of the plane
equation used to compute the elevation at any point on the
triangle.
*/
im = i - 1;
jm = j - 1;
x1 = X[i];
y1 = Y[jm];
z1 = Z[i + nx * jm];
x2 = X[im];
y2 = Y[j];
z2 = Z[im + nx * j];
if ( ((x - x1) / (x2 - x1) > (y - y1) / (y2 - y1)) )
{
x3 = X[im];
y3 = Y[jm];
z3 = Z[im + nx * jm];
}
else
{
x3 = X[i];
y3 = Y[j];
z3 = Z[i + nx * (j)];
}
A = y1 * (z2 - z3) + y2 * (z3 - z1) + y3 * (z1 - z2);
B = z1 * (x2 - x3) + z2 * (x3 - x1) + z3 * (x1 - x2);
C = x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2);
D = -A * x1 - B * y1 - C * z1;
z = -(A * x + B * y + D) / C;
}
return z;
}
/*--------------------------------------------------------------------------*/
|
