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 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783
|
/*!
\file gk.c
\brief OGSF library - setting and manipulating keyframes animation (lower level functions)
GRASS OpenGL gsurf OGSF Library
(C) 1999-2008 by the GRASS Development Team
This program is free software under the
GNU General Public License (>=v2).
Read the file COPYING that comes with GRASS
for details.
\author Bill Brown USACERL, GMSL/University of Illinois
\author Doxygenized by Martin Landa <landa.martin gmail.com> (May 2008)
*/
#include <stdlib.h>
#include <math.h>
#include <grass/gis.h>
#include <grass/glocale.h>
#include <grass/gstypes.h>
#include <grass/keyframe.h>
#include <grass/kftypes.h>
static float spl3(float, double, double, double, double, double, double,
double);
static float spl3(float tension, double data0, double data1, double x,
double x2, double x3, double lderiv, double rderiv)
{
return ((float)
(data0 * (2 * x3 - 3 * x2 + 1) + data1 * (-2 * x3 + 3 * x2) +
(double)tension * lderiv * (x3 - 2 * x2 + x) +
(double)tension * rderiv * (x3 - x2)));
}
/*!
\brief Copy keyframes
\param k source keyframes
\return pointer to Keylist struct (target)
*/
Keylist *gk_copy_key(Keylist * k)
{
Keylist *newk;
int i;
newk = (Keylist *) G_malloc(sizeof(Keylist)); /* G_fatal_error */
if (!newk) {
return (NULL);
}
for (i = 0; i < KF_NUMFIELDS; i++) {
newk->fields[i] = k->fields[i];
}
newk->pos = k->pos;
newk->look_ahead = k->look_ahead;
newk->fieldmask = k->fieldmask;
newk->next = newk->prior = NULL;
return (newk);
}
/*!
\brief Get mask value
Get begin & end pos, AND all masks in keys <= pos
Time must be between 0.0 & 1.0
\param time timestamp
\param keys list of keyframes
\return mask value
*/
unsigned long gk_get_mask_sofar(float time, Keylist * keys)
{
Keylist *k;
float startpos, endpos, curpos;
unsigned long mask = 0xFFFFFFFF;
if (keys) {
/* find end key */
for (k = keys; k->next; k = k->next) ;
startpos = keys->pos;
endpos = k->pos;
curpos = startpos + time * (endpos - startpos);
for (k = keys; k->next; k = k->next) {
if (k->pos <= curpos) {
mask &= k->fieldmask; /* (else break) */
}
}
}
return (mask);
}
/*!
\brief ADD
\param mask mask value
\param keys list of keyframes
\param[out] keyret output list of keyframes
\return number of output keyframes
*/
int gk_viable_keys_for_mask(unsigned long mask, Keylist * keys,
Keylist ** keyret)
{
Keylist *k;
int cnt = 0;
for (k = keys; k; k = k->next) {
if ((mask & k->fieldmask) == mask) {
keyret[cnt++] = k;
}
}
return (cnt);
}
/*!
\brief Checks key masks
Because if they're masked up until the current position,
pre-existing (or current) field should be used.
\param view pointer to Viewmode struct
\param numsteps number of steps
\param keys list of keyframes
\param step step value
\param onestep
\param render
\param mode
*/
void gk_follow_frames(Viewnode * view, int numsteps, Keylist * keys, int step,
int onestep, int render, unsigned long mode)
{
Viewnode *v;
int frame; /* frame is index into viewnode array */
float tmp[3];
float x, y, z;
int num, w;
unsigned long mask;
for (frame = step - 1; frame < numsteps; frame++) {
v = &view[frame];
mask = gk_get_mask_sofar((float)frame / numsteps, keys);
/* TODO?: set view field to current settings if not set,
thereby keeping view structure up to date for easier saving of
animation? */
GS_get_from(tmp);
if ((mask & KF_FROMX_MASK)) {
tmp[X] = v->fields[KF_FROMX];
}
if ((mask & KF_FROMY_MASK)) {
tmp[Y] = v->fields[KF_FROMY];
}
if ((mask & KF_FROMZ_MASK)) {
tmp[Z] = v->fields[KF_FROMZ];
}
GS_moveto(tmp);
GS_get_from(tmp);
G_debug(3, "gk_follow_frames():");
G_debug(3, " MASK: %lx", mask);
G_debug(3, " FROM: %f %f %f", tmp[X], tmp[Y], tmp[Z]);
/* ACS 1 line: was GS_get_focus(tmp);
with this kanimator works also for flythrough navigation
also changed in GK2.c
*/
GS_get_viewdir(tmp);
if ((mask & KF_DIRX_MASK)) {
tmp[X] = v->fields[KF_DIRX];
}
if ((mask & KF_DIRY_MASK)) {
tmp[Y] = v->fields[KF_DIRY];
}
if ((mask & KF_DIRZ_MASK)) {
tmp[Z] = v->fields[KF_DIRZ];
}
/* ACS 1 line: was GS_set_focus(tmp);
with this kanimator works also for flythrough navigation
also changed in GK2.c
*/
GS_set_viewdir(tmp);
G_debug(3, "gk_follow_frames():");
GS_get_viewdir(tmp);
G_debug(3, " DIR: %f %f %f\n", tmp[X], tmp[Y], tmp[Z]);
if ((mask & KF_TWIST_MASK)) {
GS_set_twist((int)v->fields[KF_TWIST]);
}
if ((mask & KF_FOV_MASK)) {
GS_set_fov((int)v->fields[KF_FOV]);
}
/* Initilaize lights before drawing */
num = 1;
GS_getlight_position(num, &x, &y, &z, &w);
GS_setlight_position(num, x, y, z, w);
num = 2; /* Top light */
GS_setlight_position(num, 0., 0., 1., 0);
if (render) {
GS_set_draw(GSD_FRONT);
}
else {
GS_set_draw(GSD_BACK);
}
GS_ready_draw();
GS_clear(GS_background_color());
if (render) {
GS_alldraw_surf();
}
else {
GS_alldraw_wire();
}
GS_alldraw_cplane_fences();
if (mode & FM_PATH) {
gk_draw_path(view, numsteps, keys);
}
if (mode & FM_VECT) {
GV_alldraw_vect();
}
if (mode & FM_SITE) {
GP_alldraw_site();
}
if (mode & FM_VOL) {
GVL_alldraw_vol();
}
GS_done_draw();
if (mode & FM_LABEL) {
GS_draw_all_list(); /* draw labels and legend */
}
if (onestep) {
return;
}
}
return;
}
/*!
\brief Free keyframe list
\param ok pointer to Keylist struct
*/
void gk_free_key(Keylist * ok)
{
Keylist *k, *prev;
if (ok) {
k = ok;
while (k) {
prev = k;
k = k->next;
G_free(prev);
}
}
return;
}
/*!
\brief Generate viewnode from keyframes
Here we use a cardinal cubic spline
\param keys list of keyframes
\param keysteps keyframe step
\param newsteps new step value
\param loop loop indicator
\param t
\return pointer to Viewnode
\return NULL on failure
*/
Viewnode *gk_make_framesfromkeys(Keylist * keys, int keysteps, int newsteps,
int loop, float t)
{
int i;
Viewnode *v, *newview;
Keylist *k, *kp1, *kp2, *km1, **tkeys;
float startpos, endpos;
double dt1, dt2, x, x2, x3, range, time, time_step, len, rderiv, lderiv;
/* allocate tmp keys to hold valid keys for fields */
tkeys = (Keylist **) G_malloc(keysteps * sizeof(Keylist *)); /* G_fatal_error */
if (!tkeys) {
return (NULL);
}
correct_twist(keys);
if (keys && keysteps) {
if (keysteps < 3) {
G_warning(_("Need at least 3 keyframes for spline"));
G_free(tkeys);
return (NULL);
}
/* find end key */
for (k = keys; k->next; k = k->next) ;
startpos = keys->pos;
endpos = k->pos;
range = endpos - startpos;
time_step = range / (newsteps - 1);
newview = (Viewnode *) G_malloc(newsteps * sizeof(Viewnode)); /* G_fatal_error */
if (!newview) { /* not used */
G_free(tkeys);
return (NULL);
}
for (i = 0; i < newsteps; i++) {
int field = 0;
v = &newview[i];
time = startpos + i * time_step;
if (i == newsteps - 1) {
time = endpos; /*to ensure no roundoff errors */
}
for (field = 0; field < KF_NUMFIELDS; field++) {
int nvk = 0; /* number of viable keyframes for this field */
/* now need to do for each field to look at mask */
k = kp1 = kp2 = km1 = NULL;
nvk = gk_viable_keys_for_mask((unsigned long)(1 << field),
keys, tkeys);
if (nvk) {
len = get_key_neighbors(nvk, time, range,
loop, tkeys, &k, &kp1, &kp2, &km1,
&dt1, &dt2);
}
/* ACS 1 line: was if (len == 0.0) {
when disabling a channel no calculation must be made at all (otherwise core dump)
*/
if (len == 0.0 || nvk == 0) {
if (!k) {
/* none valid - use first.
(when showing , will be ignored anyway) */
v->fields[field] = keys->fields[field];
}
else if (!kp1) {
/* none on right - use left */
v->fields[field] = k->fields[field];
}
continue;
}
else if (!km1 && !kp2) {
/* only two valid - use linear */
v->fields[field] = lin_interp((time - k->pos) / len,
k->fields[field],
kp1->fields[field]);
continue;
}
x = (time - k->pos) / len;
x2 = x * x;
x3 = x2 * x;
if (!km1) {
/* leftmost interval */
rderiv = (kp2->fields[field] - k->fields[field]) / dt2;
lderiv = (3 * (kp1->fields[field] -
k->fields[field]) / dt1 - rderiv) / 2.0;
v->fields[field] = spl3(t, k->fields[field],
kp1->fields[field], x, x2, x3,
lderiv, rderiv);
}
else if (!kp2) {
/* rightmost interval */
lderiv = (kp1->fields[field] - km1->fields[field]) / dt1;
rderiv = (3 * (kp1->fields[field] -
k->fields[field]) / dt2 - lderiv) / 2.0;
v->fields[field] = spl3(t, k->fields[field],
kp1->fields[field], x, x2, x3,
lderiv, rderiv);
}
else {
/* not on ends */
lderiv = (kp1->fields[field] - km1->fields[field]) / dt1;
rderiv = (kp2->fields[field] - k->fields[field]) / dt2;
v->fields[field] = spl3(t, k->fields[field],
kp1->fields[field], x, x2, x3,
lderiv, rderiv);
}
}
}
G_free(tkeys);
return (newview);
}
else {
G_free(tkeys);
return (NULL);
}
}
/*!
\brief Find interval containing time
Changed June 94 to handle masks - now need to have called get_viable_keys
for appropriate mask first to build the ARRAY of viable keyframes.
Putting left (or equal) key
at km1, right at kp1, 2nd to right at kp2, and second to left at km2.
dt1 is given the length of the current + left intervals
dt2 is given the length of the current + right intervals
\param nvk
\param time
\param range
\param loop
\param karray
\param km1
\param kp1
\param kp2
\param km2
\param dt1
\param dt2
\return the length of the current interval
\return 0 on error
*/
double get_key_neighbors(int nvk, double time, double range, int loop,
Keylist * karray[], Keylist ** km1, Keylist ** kp1,
Keylist ** kp2, Keylist ** km2, double *dt1,
double *dt2)
{
int i;
double len;
*km1 = *kp1 = *kp2 = *km2 = NULL;
*dt1 = *dt2 = 0.0;
for (i = 0; i < nvk; i++) {
if (time < karray[i]->pos) {
break;
}
}
if (!i) {
return (0.0); /* before first keyframe or nvk == 0 */
}
if (i == nvk) {
/* past or == last keyframe! */
*km1 = karray[nvk - 1];
return (0.0);
}
/* there's at least 2 */
*km1 = karray[i - 1];
*kp1 = karray[i];
len = karray[i]->pos - karray[i - 1]->pos;
if (i == 1) {
/* first interval */
if (loop) {
*km2 = karray[nvk - 2];
*kp2 = karray[(i + 1) % nvk];
}
else {
if (nvk > 2) {
*kp2 = karray[i + 1];
}
}
}
else if (i == nvk - 1) {
/* last interval */
if (loop) {
*km2 = nvk > 2 ? karray[i - 2] : karray[1];
*kp2 = karray[1];
}
else {
if (nvk > 2) {
*km2 = karray[i - 2];
}
}
}
else {
*km2 = karray[i - 2];
*kp2 = karray[i + 1];
}
*dt1 = (*km2) ? (*kp1)->pos - (*km2)->pos : len;
*dt2 = (*kp2) ? (*kp2)->pos - (*km1)->pos : len;
if (i == 1 && loop) {
*dt1 += range;
}
if (i == nvk - 1 && loop) {
*dt2 += range;
}
return (len);
}
/*!
\brief Linear interpolation
\param dt coeficient
\param val2 value 2
\param val1 value 1
\return val1 + dt * (val2 - val1)
*/
double lin_interp(float dt, float val1, float val2)
{
return ((double)(val1 + dt * (val2 - val1)));
}
/*!
\brief Finds interval containing time, putting left (or equal) key
at km1, right at kp1
\param nvk
\param time
\param range
\param loop
\param karray
\param km1
\param km2
\return interval value
*/
double get_2key_neighbors(int nvk, float time, float range, int loop,
Keylist * karray[], Keylist ** km1, Keylist ** kp1)
{
int i;
double len;
*km1 = *kp1 = NULL;
for (i = 0; i < nvk; i++) {
if (time < karray[i]->pos) {
break;
}
}
if (!i) {
return (0.0); /* before first keyframe or nvk == 0 */
}
if (i == nvk) {
/* past or == last keyframe! */
*km1 = karray[nvk - 1];
return (0.0);
}
/* there's at least 2 */
*km1 = karray[i - 1];
*kp1 = karray[i];
len = karray[i]->pos - karray[i - 1]->pos;
return (len);
}
/*!
\brief Generate viewnode from keyframe list (linear interpolation)
Here we use linear interpolation. Loop variable isn't used, but left
in for use in possible "linear interp with smoothing" version.
\param kesy keyframe list
\param keysteps step value
\param newsteps new step value
\param loop loop indicator
\param pointer to viewnode struct
\param NULL on failure
*/
Viewnode *gk_make_linear_framesfromkeys(Keylist * keys, int keysteps,
int newsteps, int loop)
{
int i, nvk;
Viewnode *v, *newview;
Keylist *k, *k1, *k2, **tkeys;
float startpos, endpos, dt, range, time, time_step, len;
/* allocate tmp keys to hold valid keys for fields */
tkeys = (Keylist **) G_malloc(keysteps * sizeof(Keylist *)); /* G_fatal_error */
if (!tkeys) {
return (NULL);
}
correct_twist(keys);
if (keys && keysteps) {
if (keysteps < 2) {
G_warning(_("Need at least 2 keyframes for interpolation"));
G_free(tkeys);
return (NULL);
}
/* find end key */
for (k = keys; k->next; k = k->next) ;
startpos = keys->pos;
endpos = k->pos;
range = endpos - startpos;
time_step = range / (newsteps - 1);
newview = (Viewnode *) G_malloc(newsteps * sizeof(Viewnode)); /* G_fatal_error */
if (!newview) { /* not used */
G_free(tkeys);
return (NULL);
}
for (i = 0; i < newsteps; i++) {
int field = 0;
v = &newview[i];
time = startpos + i * time_step;
if (i == newsteps - 1) {
time = endpos; /*to ensure no roundoff errors */
}
for (field = 0; field < KF_NUMFIELDS; field++) {
nvk = gk_viable_keys_for_mask((unsigned long)(1 << field),
keys, tkeys);
if (!nvk) {
v->fields[field] = keys->fields[field]; /*default-not used */
}
else {
len = get_2key_neighbors(nvk, time, range, loop,
tkeys, &k1, &k2);
}
/* ACS 1 line: was if (len == 0.0) {
when disabling a channel no calculation must be made at all (otherwise core dump)
*/
if (len == 0.0 || nvk == 0) {
if (!k1) {
/* none valid - use first.
(when showing , will be ignored anyway) */
v->fields[field] = keys->fields[field];
}
else if (!k2) {
/* none on right - use left */
v->fields[field] = k1->fields[field];
}
}
else {
dt = (time - k1->pos) / len;
v->fields[field] = lin_interp(dt,
k1->fields[field],
k2->fields[field]);
}
}
}
G_free(tkeys);
return (newview);
}
else {
G_free(tkeys);
return (NULL);
}
}
/*!
\brief Correct twist value
\param k keyframe list
*/
void correct_twist(Keylist * k)
{
Keylist *c, *p, *t;
int cnt, j;
p = NULL;
cnt = 0;
for (c = k; c; c = c->next) {
if (p) {
if ((c->fields[KF_TWIST] - p->fields[KF_TWIST]) > 1800.) {
for (t = c; t; t = t->next) {
t->fields[KF_TWIST] -= 3600.;
}
}
else if ((p->fields[KF_TWIST] - c->fields[KF_TWIST]) > 1800.) {
for (t = k, j = 0; j < cnt; j++, t = t->next) {
t->fields[KF_TWIST] -= 3600.;
}
}
}
p = c;
++cnt;
}
return;
}
/*!
\brief Draw path
\param views Viewnode struct
\param steps step value
\param keys keyframe list
\return 0 on failure
\return 1 on success
*/
int gk_draw_path(Viewnode * views, int steps, Keylist * keys)
{
Viewnode *v;
Keylist *k;
int frame;
float siz, from[3];
if (!views || !keys) {
return (0);
}
GS_get_longdim(&siz);
siz /= 200.;
gsd_colormode(CM_COLOR);
gsd_linewidth(2);
gsd_color_func(GS_default_draw_color());
gsd_zwritemask(0);
gsd_bgnline();
for (frame = 0; frame < steps; frame++) {
v = &views[frame];
gsd_vert_func(&(v->fields[KF_FROMX]));
}
gsd_endline();
gsd_linewidth(1);
for (k = keys; k; k = k->next) {
gsd_x(NULL, &(k->fields[KF_FROMX]),
~(GS_background_color() | 0xFF0000), siz);
}
/* draw viewer position for inset images */
GS_get_from(from);
gsd_x(NULL, from, ~(GS_default_draw_color() | 0xFFFF00), 3.0 * siz);
gsd_zwritemask(0xffffffff);
return (1);
}
|