[140] | 1 | // This file is a part of the Framsticks GDK. |
---|
| 2 | // Copyright (C) 2002-2014 Maciej Komosinski and Szymon Ulatowski. See LICENSE.txt for details. |
---|
| 3 | // Refer to http://www.framsticks.com/ for further information. |
---|
| 4 | |
---|
| 5 | #include "conv_fF.h" |
---|
| 6 | #include "fF_genotype.h" |
---|
| 7 | #include <frams/model/model.h> |
---|
| 8 | #include <common/nonstd_stl.h> |
---|
| 9 | |
---|
[176] | 10 | GenoConv_fF0::GenoConv_fF0() |
---|
| 11 | { |
---|
| 12 | name = "7-value Foraminifera encoding"; |
---|
| 13 | in_format = 'F'; |
---|
| 14 | out_format = '0'; |
---|
| 15 | mapsupport = 0; |
---|
| 16 | cosines = new double[fF_LATITUDE_NUM]; |
---|
| 17 | sines = new double[fF_LATITUDE_NUM]; |
---|
| 18 | fill_cos_and_sin(); |
---|
[140] | 19 | } |
---|
| 20 | |
---|
[176] | 21 | GenoConv_fF0::~GenoConv_fF0() |
---|
| 22 | { |
---|
| 23 | delete[] cosines; |
---|
| 24 | delete[] sines; |
---|
[174] | 25 | } |
---|
[140] | 26 | |
---|
[176] | 27 | SString GenoConv_fF0::convert(SString &in, MultiMap *map) |
---|
| 28 | { |
---|
| 29 | fF_growth_params gp; |
---|
| 30 | if (!gp.load(in)) //invalid input genotype? |
---|
| 31 | return ""; //so we return an invalid f0 genotype |
---|
[140] | 32 | |
---|
[176] | 33 | double div_radius_length = 1;//div_radius_length=1 or kx=ky=kz=1 |
---|
| 34 | double radius = 1; |
---|
[140] | 35 | |
---|
[176] | 36 | Model m; |
---|
| 37 | m.open(); |
---|
| 38 | // subsequent parts (chambers) are placed relative to the previous part's orientation and location |
---|
| 39 | Part *p1, *p2; |
---|
[140] | 40 | |
---|
[176] | 41 | fF_chamber3d **chambers = new fF_chamber3d*[gp.number_of_chambers]; |
---|
[140] | 42 | |
---|
[176] | 43 | for (int i = 0; i < gp.number_of_chambers; i++) { |
---|
| 44 | createSphere(i, chambers, radius, div_radius_length, gp.translation, gp.angle1, gp.angle2, gp.scalex, gp.scaley, gp.scalez); |
---|
| 45 | } |
---|
[174] | 46 | |
---|
[176] | 47 | p1 = m.addNewPart(Part::SHAPE_ELLIPSOID); |
---|
| 48 | p1->p = Pt3D(chambers[0]->centerX, chambers[0]->centerY, chambers[0]->centerZ); |
---|
[174] | 49 | |
---|
| 50 | |
---|
[176] | 51 | for (int i = 1; i < gp.number_of_chambers; i++, p1 = p2) { |
---|
| 52 | p2 = m.addNewPart(Part::SHAPE_ELLIPSOID); |
---|
| 53 | p2->scale = p1->scale.entrywiseProduct(Pt3D(gp.scalex, gp.scaley, gp.scalez)); //each part's scale is its predecessor's scale * scaling |
---|
[174] | 54 | |
---|
[176] | 55 | p2->p = Pt3D(chambers[i]->centerX, chambers[i]->centerY, chambers[i]->centerZ); |
---|
[174] | 56 | |
---|
[176] | 57 | m.addNewJoint(p1, p2, Joint::SHAPE_SOLID); //all parts must be connected |
---|
| 58 | } |
---|
[174] | 59 | |
---|
[176] | 60 | for (int i = 0; i < gp.number_of_chambers; i++) |
---|
| 61 | delete chambers[i]; |
---|
| 62 | delete[]chambers; |
---|
[174] | 63 | |
---|
[176] | 64 | m.close(); |
---|
| 65 | return m.getF0Geno().getGene(); |
---|
[140] | 66 | } |
---|
[174] | 67 | |
---|
| 68 | void GenoConv_fF0::createSphere(int which, fF_chamber3d **chambers, double radius_, double div_radius_length_, double div_vector_length_, |
---|
[176] | 69 | double alpha_, double gamma_, double kx_, double ky_, double kz_) |
---|
| 70 | { |
---|
| 71 | chambers[which] = new fF_chamber3d(0.0f, 0.0f, 0.0f, |
---|
| 72 | (float)radius_, (float)radius_ * (float)kx_, 0.0f, 0.0f, |
---|
| 73 | (float)(radius_ * div_vector_length_), 0.0f, 0.0f, 0.0f, 0.0f); |
---|
| 74 | if (which == 0) |
---|
| 75 | chambers[which]->points = generate_points(chambers[which], which, kx_, ky_, kz_); |
---|
| 76 | if (which > 0) { |
---|
| 77 | /* old radius */ |
---|
| 78 | double radiusOld, radius; |
---|
| 79 | radiusOld = chambers[which - 1]->radius; |
---|
| 80 | radius = div_radius_length_ * radiusOld; |
---|
| 81 | /* new growth vector length */ |
---|
| 82 | double len = radius * div_vector_length_; |
---|
| 83 | if (radius < fF_TOO_LITTLE) { |
---|
| 84 | radius = fF_TOO_LITTLE; |
---|
| 85 | if (fabs(len) >(fF_TOO_MUCH * radius)) { |
---|
| 86 | len = ((len < 0) ? (-1) : 1) * fF_TOO_MUCH * radius; |
---|
| 87 | } |
---|
| 88 | } |
---|
| 89 | if (len == 0) { |
---|
| 90 | len = -0.0000001; |
---|
| 91 | } |
---|
[174] | 92 | |
---|
[176] | 93 | /* aperture of the previous chamber */ |
---|
| 94 | double pzx = chambers[which - 1]->holeX; |
---|
| 95 | double pzy = chambers[which - 1]->holeY; |
---|
| 96 | double pzz = chambers[which - 1]->holeZ; |
---|
[174] | 97 | |
---|
[176] | 98 | //center of the previous chamber |
---|
| 99 | double pcx = chambers[which - 1]->centerX; |
---|
| 100 | double pcy = chambers[which - 1]->centerY; |
---|
| 101 | double pcz = chambers[which - 1]->centerZ; |
---|
[174] | 102 | |
---|
[176] | 103 | /* aperture of the next to last chamber */ |
---|
| 104 | double ppx; |
---|
| 105 | double ppy; |
---|
| 106 | double ppz; |
---|
[174] | 107 | |
---|
[176] | 108 | if (which == 1) { |
---|
| 109 | ppx = pcx; |
---|
| 110 | ppy = pcy; |
---|
| 111 | ppz = pcz; |
---|
| 112 | } |
---|
| 113 | else { |
---|
| 114 | ppx = chambers[which - 2]->holeX; |
---|
| 115 | ppy = chambers[which - 2]->holeY; |
---|
| 116 | ppz = chambers[which - 2]->holeZ; |
---|
| 117 | } |
---|
[174] | 118 | |
---|
[176] | 119 | double pzxprim = pzx - ppx; |
---|
| 120 | double pzyprim = pzy - ppy; |
---|
| 121 | double angle; |
---|
[174] | 122 | |
---|
[176] | 123 | angle = atan2(pzyprim, pzxprim); |
---|
| 124 | double alpha = angle - alpha_; |
---|
[174] | 125 | |
---|
| 126 | |
---|
[176] | 127 | double gamma = chambers[which - 1]->phi + gamma_; |
---|
[174] | 128 | |
---|
[176] | 129 | /* x */ |
---|
| 130 | double wx = len * cos(alpha); |
---|
| 131 | /* y */ |
---|
| 132 | double wy = len * sin(alpha); |
---|
| 133 | /* y */ |
---|
| 134 | double wz = len * sin(alpha) * sin(gamma); |
---|
[174] | 135 | |
---|
[176] | 136 | /*center of the new sphere*/ |
---|
| 137 | double x = pzx + wx; |
---|
| 138 | double y = pzy + wy; |
---|
| 139 | double z = pzz + wz; |
---|
[174] | 140 | |
---|
[176] | 141 | chambers[which]->centerX = (float)x; |
---|
| 142 | chambers[which]->centerY = (float)y; |
---|
| 143 | chambers[which]->centerZ = (float)z; |
---|
| 144 | chambers[which]->radius = (float)radius; |
---|
| 145 | chambers[which]->vectorTfX = (float)wx; |
---|
| 146 | chambers[which]->vectorTfY = (float)wy; |
---|
| 147 | chambers[which]->vectorTfZ = (float)wz; |
---|
| 148 | chambers[which]->beta = (float)alpha; |
---|
| 149 | chambers[which]->phi = (float)gamma; |
---|
[174] | 150 | |
---|
[176] | 151 | chambers[which]->points = generate_points(chambers[which], which, kx_, ky_, kz_); |
---|
| 152 | search_hid(which, chambers, kx_, ky_, kz_); |
---|
| 153 | int pun; |
---|
| 154 | pun = find_hole(which, pzx, pzy, pzz, chambers, kx_, ky_, kz_); |
---|
[174] | 155 | |
---|
[176] | 156 | chambers[which]->holeX = (float)chambers[which]->points[pun][0]; |
---|
| 157 | chambers[which]->holeY = (float)chambers[which]->points[pun][1]; |
---|
| 158 | chambers[which]->holeZ = (float)chambers[which]->points[pun][2]; |
---|
| 159 | } |
---|
[174] | 160 | } |
---|
| 161 | |
---|
[176] | 162 | void GenoConv_fF0::fill_cos_and_sin() |
---|
| 163 | { |
---|
| 164 | int i; |
---|
| 165 | double pi = acos(-1.0); |
---|
| 166 | double angle = pi / (((double)fF_LATITUDE_NUM)*0.5); |
---|
| 167 | for (i = 0; i < fF_LATITUDE_NUM; i++) |
---|
| 168 | { |
---|
| 169 | cosines[i] = cos((double)i * angle); |
---|
| 170 | sines[i] = sin((double)i * angle); |
---|
| 171 | } |
---|
[174] | 172 | } |
---|
| 173 | |
---|
[176] | 174 | double** GenoConv_fF0::generate_points(fF_chamber3d *chamber, int which, double kx_, double ky_, double kz_) |
---|
| 175 | { |
---|
| 176 | float radius = chamber->radius; |
---|
| 177 | float cenx = chamber->centerX; |
---|
| 178 | float ceny = chamber->centerY; |
---|
| 179 | float cenz = chamber->centerZ; |
---|
[174] | 180 | |
---|
[176] | 181 | double maxX = 0; |
---|
| 182 | double maxY = 0; |
---|
| 183 | double minX = 0; |
---|
| 184 | double minY = 0; |
---|
| 185 | double minZ = 0; |
---|
[174] | 186 | |
---|
[176] | 187 | double kx = 1; |
---|
| 188 | double ky = 1; |
---|
| 189 | double kz = 1; |
---|
[174] | 190 | |
---|
[176] | 191 | if (which > 0) { |
---|
| 192 | for (int kt = 1; kt < (which + 1); kt++) { |
---|
| 193 | kx = kx * kx_; |
---|
| 194 | ky = ky * ky_; |
---|
| 195 | kz = kz * kz_; |
---|
| 196 | } |
---|
| 197 | } |
---|
[174] | 198 | |
---|
[176] | 199 | int i, j; |
---|
| 200 | double x, y, z; |
---|
[174] | 201 | |
---|
[176] | 202 | double **points = new double*[fF_SIZE]; |
---|
| 203 | for (int i = 0; i < fF_SIZE; i++) { |
---|
| 204 | points[i] = new double[4]; |
---|
| 205 | } |
---|
[174] | 206 | |
---|
[176] | 207 | for (i = 0; i < fF_LONGITUDE_NUM; i++) { |
---|
| 208 | if (kx_ == 1 && ky_ == 1 && kz_ == 1) { |
---|
| 209 | y = ceny + radius * cosines[i]; |
---|
| 210 | } |
---|
| 211 | else { |
---|
| 212 | y = ceny + ky * cosines[i]; |
---|
| 213 | } |
---|
| 214 | for (j = 0; j < fF_LATITUDE_NUM; j++) { |
---|
| 215 | if (kx_ == 1 && ky_ == 1 && kz_ == 1) { |
---|
| 216 | points[(i * fF_LATITUDE_NUM) + j][0] = x = cenx + radius * cosines[j] * sines[i]; |
---|
| 217 | points[(i * fF_LATITUDE_NUM) + j][1] = y; |
---|
| 218 | points[(i * fF_LATITUDE_NUM) + j][2] = z = cenz + radius * sines[j] * sines[i]; |
---|
| 219 | } |
---|
| 220 | else { |
---|
| 221 | points[(i * fF_LATITUDE_NUM) + j][0] = x = cenx + kx * cosines[j] * sines[i]; |
---|
| 222 | points[(i * fF_LATITUDE_NUM) + j][1] = y; |
---|
| 223 | points[(i * fF_LATITUDE_NUM) + j][2] = z = cenz + kz * sines[j] * sines[i]; |
---|
| 224 | } |
---|
[174] | 225 | |
---|
[176] | 226 | points[(i * fF_LATITUDE_NUM) + j][3] = 1.0; |
---|
| 227 | if (x < minX) minX = x; |
---|
| 228 | if (x > maxX) maxX = x; |
---|
| 229 | if (y < minY) minY = y; |
---|
| 230 | if (y > maxY) maxY = y; |
---|
| 231 | |
---|
| 232 | if (z < minZ) minZ = z; |
---|
| 233 | }; |
---|
| 234 | }; |
---|
| 235 | return points; |
---|
| 236 | |
---|
[174] | 237 | } |
---|
| 238 | |
---|
[176] | 239 | double GenoConv_fF0::dist(double x1, double y1, double z1, double x2, double y2, double z2) |
---|
| 240 | { |
---|
| 241 | return sqrt((x2 - x1)*(x2 - x1) + (y2 - y1)*(y2 - y1) + (z2 - z1)*(z2 - z1)); |
---|
[174] | 242 | } |
---|
| 243 | |
---|
[176] | 244 | void GenoConv_fF0::search_hid(int nr, fF_chamber3d **spheres, double kx_, double ky_, double kz_) |
---|
| 245 | { |
---|
| 246 | int i, j; |
---|
| 247 | if (nr != 0) { |
---|
| 248 | for (i = 0; i < nr; i++) { |
---|
| 249 | for (j = 0; j < fF_AMOUNT; j++) { |
---|
| 250 | double X = spheres[nr]->points[j][0]; |
---|
| 251 | double Y = spheres[nr]->points[j][1]; |
---|
| 252 | double Z = spheres[nr]->points[j][2]; |
---|
[174] | 253 | |
---|
[176] | 254 | double srX0 = spheres[i]->centerX; |
---|
| 255 | double srY0 = spheres[i]->centerY; |
---|
| 256 | double srZ0 = spheres[i]->centerZ; |
---|
[174] | 257 | |
---|
[176] | 258 | double a2; |
---|
| 259 | double b2; |
---|
| 260 | double c2; |
---|
[174] | 261 | |
---|
[176] | 262 | if (kx_ != 1) { |
---|
| 263 | a2 = (kx_ * kx_); |
---|
| 264 | } |
---|
| 265 | else { |
---|
| 266 | a2 = (spheres[i]->radius * spheres[i]->radius); |
---|
| 267 | } |
---|
[174] | 268 | |
---|
[176] | 269 | if (ky_ != 1) { |
---|
| 270 | b2 = (ky_ * ky_); |
---|
[174] | 271 | |
---|
[176] | 272 | } |
---|
| 273 | else { |
---|
| 274 | b2 = (spheres[i]->radius * spheres[i]->radius); |
---|
| 275 | } |
---|
[174] | 276 | |
---|
[176] | 277 | c2 = (kz_ * spheres[i]->radius) * (kz_ * spheres[i]->radius); |
---|
[174] | 278 | |
---|
[176] | 279 | double up1 = (X - srX0) * (X - srX0); |
---|
| 280 | double up2 = (Y - srY0) * (Y - srY0); |
---|
| 281 | double up3 = (Z - srZ0) * (Z - srZ0); |
---|
[174] | 282 | |
---|
[176] | 283 | double exp = up1 / a2; |
---|
| 284 | double exp2 = up2 / b2; |
---|
| 285 | double exp3 = up3 / c2; |
---|
[174] | 286 | |
---|
[176] | 287 | double result = exp + exp2 + exp3; |
---|
[174] | 288 | |
---|
[176] | 289 | if (result < (fF_THICK_RATIO) |
---|
| 290 | ) { |
---|
| 291 | spheres[nr]->points[j][3] = 0; |
---|
| 292 | } |
---|
| 293 | } |
---|
| 294 | } |
---|
| 295 | } |
---|
[174] | 296 | } |
---|
| 297 | |
---|
[176] | 298 | int GenoConv_fF0::find_hole(int which, double x, double y, double z, fF_chamber3d **chambers, double kx_, double ky_, double kz_) |
---|
| 299 | { |
---|
| 300 | int i; |
---|
| 301 | double distance; |
---|
| 302 | int found = 0; |
---|
| 303 | double dist_found = 0; |
---|
| 304 | int first = 1; |
---|
[174] | 305 | |
---|
[176] | 306 | for (i = 0; i < fF_AMOUNT; i++) { |
---|
| 307 | if (chambers[which]->points[i][3] != 0) //it is not inside another chamber |
---|
| 308 | { |
---|
| 309 | distance = sqrt((chambers[which]->points[i][0] - x)*(chambers[which]->points[i][0] - x) + |
---|
| 310 | (chambers[which]->points[i][1] - y)*(chambers[which]->points[i][1] - y) + |
---|
| 311 | (chambers[which]->points[i][2] - z)*(chambers[which]->points[i][2] - z)); |
---|
| 312 | if (first != 0) { |
---|
| 313 | found = i; |
---|
| 314 | dist_found = distance; |
---|
| 315 | first = 0; |
---|
| 316 | } |
---|
| 317 | if (distance < dist_found) { |
---|
| 318 | if (which != 0) { |
---|
| 319 | bool good = true; |
---|
| 320 | for (int j = 0; j < which; j++) { |
---|
| 321 | { |
---|
| 322 | double X = chambers[which]->points[i][0]; |
---|
| 323 | double Y = chambers[which]->points[i][1]; |
---|
| 324 | double Z = chambers[which]->points[i][2]; |
---|
[174] | 325 | |
---|
[176] | 326 | double srX0 = chambers[j]->centerX; |
---|
| 327 | double srY0 = chambers[j]->centerY; |
---|
| 328 | double srZ0 = chambers[j]->centerZ; |
---|
[174] | 329 | |
---|
[176] | 330 | double a2 = (kx_ * chambers[j]->radius) * (kx_ * chambers[j]->radius); |
---|
| 331 | double b2 = (ky_ * chambers[j]->radius) * (ky_ * chambers[j]->radius); |
---|
| 332 | double c2 = (kz_ * chambers[j]->radius) * (kz_ * chambers[j]->radius); |
---|
[174] | 333 | |
---|
[176] | 334 | double up1 = (X - srX0) * (X - srX0); |
---|
| 335 | double up2 = (Y - srY0) * (Y - srY0); |
---|
| 336 | double up3 = (Z - srZ0) * (Z - srZ0); |
---|
[174] | 337 | |
---|
[176] | 338 | double exp1 = up1 / a2; |
---|
| 339 | double exp2 = up2 / b2; |
---|
| 340 | double exp3 = up3 / c2; |
---|
[174] | 341 | |
---|
[176] | 342 | double result = exp1 + exp2 + exp3; |
---|
| 343 | if (result < 1.0) |
---|
| 344 | { |
---|
| 345 | good = false; |
---|
| 346 | } |
---|
| 347 | } |
---|
| 348 | } |
---|
| 349 | if (good) { |
---|
| 350 | found = i; |
---|
| 351 | dist_found = distance; |
---|
| 352 | } |
---|
| 353 | } |
---|
| 354 | } |
---|
| 355 | } |
---|
| 356 | } |
---|
[174] | 357 | |
---|
[176] | 358 | return (found); |
---|
| 359 | } |
---|