AnimationHandler.js 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257
  1. /**
  2. * @author mikael emtinger / http://gomo.se/
  3. */
  4. THREE.AnimationHandler = (function() {
  5. var playing = [];
  6. var library = {};
  7. var that = {};
  8. //--- update ---
  9. that.update = function( deltaTimeMS ) {
  10. for( var i = 0; i < playing.length; i++ )
  11. playing[ i ].update( deltaTimeMS );
  12. };
  13. //--- add ---
  14. that.addToUpdate = function( animation ) {
  15. if( playing.indexOf( animation ) === -1 )
  16. playing.push( animation );
  17. };
  18. //--- remove ---
  19. that.removeFromUpdate = function( animation ) {
  20. var index = playing.indexOf( animation );
  21. if( index !== -1 )
  22. playing.splice( index, 1 );
  23. };
  24. //--- add ---
  25. that.add = function( data ) {
  26. if( library[ data.name ] !== undefined )
  27. console.log( "THREE.AnimationHandler.add: Warning! " + data.name + " already exists in library. Overwriting." );
  28. library[ data.name ] = data;
  29. initData( data );
  30. };
  31. //--- get ---
  32. that.get = function( name ) {
  33. if( typeof name === "string" ) {
  34. if( library[ name ] ) {
  35. return library[ name ];
  36. } else {
  37. console.log( "THREE.AnimationHandler.get: Couldn't find animation " + name );
  38. return null;
  39. }
  40. } else {
  41. // todo: add simple tween library
  42. }
  43. };
  44. //--- parse ---
  45. that.parse = function( root ) {
  46. // setup hierarchy
  47. var hierarchy = [];
  48. if ( root instanceof THREE.SkinnedMesh ) {
  49. for( var b = 0; b < root.bones.length; b++ ) {
  50. hierarchy.push( root.bones[ b ] );
  51. }
  52. } else {
  53. parseRecurseHierarchy( root, hierarchy );
  54. }
  55. return hierarchy;
  56. };
  57. var parseRecurseHierarchy = function( root, hierarchy ) {
  58. hierarchy.push( root );
  59. for( var c = 0; c < root.children.length; c++ )
  60. parseRecurseHierarchy( root.children[ c ], hierarchy );
  61. }
  62. //--- init data ---
  63. var initData = function( data ) {
  64. if( data.initialized === true )
  65. return;
  66. // loop through all keys
  67. for( var h = 0; h < data.hierarchy.length; h ++ ) {
  68. for( var k = 0; k < data.hierarchy[ h ].keys.length; k ++ ) {
  69. // remove minus times
  70. if( data.hierarchy[ h ].keys[ k ].time < 0 )
  71. data.hierarchy[ h ].keys[ k ].time = 0;
  72. // create quaternions
  73. if( data.hierarchy[ h ].keys[ k ].rot !== undefined &&
  74. !( data.hierarchy[ h ].keys[ k ].rot instanceof THREE.Quaternion ) ) {
  75. var quat = data.hierarchy[ h ].keys[ k ].rot;
  76. data.hierarchy[ h ].keys[ k ].rot = new THREE.Quaternion( quat[0], quat[1], quat[2], quat[3] );
  77. }
  78. }
  79. // prepare morph target keys
  80. if( data.hierarchy[ h ].keys[ 0 ].morphTargets !== undefined ) {
  81. // get all used
  82. var usedMorphTargets = {};
  83. for( var k = 0; k < data.hierarchy[ h ].keys.length; k ++ ) {
  84. for( var m = 0; m < data.hierarchy[ h ].keys[ k ].morphTargets.length; m ++ ) {
  85. var morphTargetName = data.hierarchy[ h ].keys[ k ].morphTargets[ m ];
  86. usedMorphTargets[ morphTargetName ] = -1;
  87. }
  88. }
  89. data.hierarchy[ h ].usedMorphTargets = usedMorphTargets;
  90. // set all used on all frames
  91. for( var k = 0; k < data.hierarchy[ h ].keys.length; k ++ ) {
  92. var influences = {};
  93. for( var morphTargetName in usedMorphTargets ) {
  94. for( var m = 0; m < data.hierarchy[ h ].keys[ k ].morphTargets.length; m ++ ) {
  95. if( data.hierarchy[ h ].keys[ k ].morphTargets[ m ] === morphTargetName ) {
  96. influences[ morphTargetName ] = data.hierarchy[ h ].keys[ k ].morphTargetsInfluences[ m ];
  97. break;
  98. }
  99. }
  100. if( m === data.hierarchy[ h ].keys[ k ].morphTargets.length ) {
  101. influences[ morphTargetName ] = 0;
  102. }
  103. }
  104. data.hierarchy[ h ].keys[ k ].morphTargetsInfluences = influences;
  105. }
  106. }
  107. // remove all keys that are on the same time
  108. for( var k = 1; k < data.hierarchy[ h ].keys.length; k ++ ) {
  109. if( data.hierarchy[ h ].keys[ k ].time === data.hierarchy[ h ].keys[ k - 1 ].time ) {
  110. data.hierarchy[ h ].keys.splice( k, 1 );
  111. k --;
  112. }
  113. }
  114. // set index
  115. for( var k = 1; k < data.hierarchy[ h ].keys.length; k ++ ) {
  116. data.hierarchy[ h ].keys[ k ].index = k;
  117. }
  118. }
  119. // JIT
  120. var lengthInFrames = parseInt( data.length * data.fps, 10 );
  121. data.JIT = {};
  122. data.JIT.hierarchy = [];
  123. for( var h = 0; h < data.hierarchy.length; h ++ )
  124. data.JIT.hierarchy.push( new Array( lengthInFrames ) );
  125. // done
  126. data.initialized = true;
  127. };
  128. // interpolation types
  129. that.LINEAR = 0;
  130. that.CATMULLROM = 1;
  131. that.CATMULLROM_FORWARD = 2;
  132. return that;
  133. }());