2015-06-30 02:54:59 +00:00
|
|
|
/*
|
|
|
|
---------------------------------------------------------------------------
|
|
|
|
Open Asset Import Library (assimp)
|
|
|
|
---------------------------------------------------------------------------
|
|
|
|
|
2020-01-20 13:53:12 +00:00
|
|
|
Copyright (c) 2006-2020, assimp team
|
2015-06-30 02:54:59 +00:00
|
|
|
|
|
|
|
All rights reserved.
|
|
|
|
|
|
|
|
Redistribution and use of this software in source and binary forms,
|
|
|
|
with or without modification, are permitted provided that the following
|
|
|
|
conditions are met:
|
|
|
|
|
|
|
|
* Redistributions of source code must retain the above
|
|
|
|
copyright notice, this list of conditions and the
|
|
|
|
following disclaimer.
|
|
|
|
|
|
|
|
* Redistributions in binary form must reproduce the above
|
|
|
|
copyright notice, this list of conditions and the
|
|
|
|
following disclaimer in the documentation and/or other
|
|
|
|
materials provided with the distribution.
|
|
|
|
|
|
|
|
* Neither the name of the assimp team, nor the names of its
|
|
|
|
contributors may be used to endorse or promote products
|
|
|
|
derived from this software without specific prior
|
|
|
|
written permission of the assimp team.
|
|
|
|
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
---------------------------------------------------------------------------
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "assimp_view.h"
|
2018-05-09 07:51:05 +00:00
|
|
|
|
2016-04-06 08:13:02 +00:00
|
|
|
#include <tuple>
|
2015-06-30 02:54:59 +00:00
|
|
|
|
|
|
|
using namespace AssimpView;
|
|
|
|
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
|
|
// Constructor on a given animation.
|
2019-01-30 15:07:40 +00:00
|
|
|
AnimEvaluator::AnimEvaluator( const aiAnimation *pAnim )
|
|
|
|
: mAnim(pAnim)
|
|
|
|
, mLastTime(0.0) {
|
2016-04-06 08:13:02 +00:00
|
|
|
mLastPositions.resize( pAnim->mNumChannels, std::make_tuple( 0, 0, 0));
|
2015-06-30 02:54:59 +00:00
|
|
|
}
|
|
|
|
|
2019-01-30 15:07:40 +00:00
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
|
|
// Destructor.
|
|
|
|
AnimEvaluator::~AnimEvaluator() {
|
|
|
|
// empty
|
|
|
|
}
|
|
|
|
|
2015-06-30 02:54:59 +00:00
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
|
|
// Evaluates the animation tracks for a given time stamp.
|
2019-01-30 15:07:40 +00:00
|
|
|
void AnimEvaluator::Evaluate( double pTime ) {
|
2015-06-30 02:54:59 +00:00
|
|
|
// extract ticks per second. Assume default value if not given
|
|
|
|
double ticksPerSecond = mAnim->mTicksPerSecond != 0.0 ? mAnim->mTicksPerSecond : 25.0;
|
|
|
|
// every following time calculation happens in ticks
|
|
|
|
pTime *= ticksPerSecond;
|
|
|
|
|
|
|
|
// map into anim's duration
|
|
|
|
double time = 0.0f;
|
2019-01-30 15:07:40 +00:00
|
|
|
if (mAnim->mDuration > 0.0) {
|
|
|
|
time = fmod(pTime, mAnim->mDuration);
|
|
|
|
}
|
2015-06-30 02:54:59 +00:00
|
|
|
|
2019-01-30 15:07:40 +00:00
|
|
|
if (mTransforms.size() != mAnim->mNumChannels) {
|
|
|
|
mTransforms.resize(mAnim->mNumChannels);
|
|
|
|
}
|
2015-06-30 02:54:59 +00:00
|
|
|
|
|
|
|
// calculate the transformations for each animation channel
|
2019-01-30 15:07:40 +00:00
|
|
|
for( unsigned int a = 0; a < mAnim->mNumChannels; ++a ) {
|
2015-06-30 02:54:59 +00:00
|
|
|
const aiNodeAnim* channel = mAnim->mChannels[a];
|
|
|
|
|
|
|
|
// ******** Position *****
|
|
|
|
aiVector3D presentPosition( 0, 0, 0);
|
2019-01-30 15:07:40 +00:00
|
|
|
if( channel->mNumPositionKeys > 0) {
|
2015-06-30 02:54:59 +00:00
|
|
|
// Look for present frame number. Search from last position if time is after the last time, else from beginning
|
|
|
|
// Should be much quicker than always looking from start for the average use case.
|
2016-04-06 15:28:09 +00:00
|
|
|
unsigned int frame = (time >= mLastTime) ? std::get<0>(mLastPositions[a]) : 0;
|
2019-01-30 15:07:40 +00:00
|
|
|
while( frame < channel->mNumPositionKeys - 1) {
|
|
|
|
if (time < channel->mPositionKeys[frame + 1].mTime) {
|
2015-06-30 02:54:59 +00:00
|
|
|
break;
|
2019-01-30 15:07:40 +00:00
|
|
|
}
|
|
|
|
++frame;
|
2015-06-30 02:54:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// interpolate between this frame's value and next frame's value
|
|
|
|
unsigned int nextFrame = (frame + 1) % channel->mNumPositionKeys;
|
|
|
|
const aiVectorKey& key = channel->mPositionKeys[frame];
|
|
|
|
const aiVectorKey& nextKey = channel->mPositionKeys[nextFrame];
|
|
|
|
double diffTime = nextKey.mTime - key.mTime;
|
2019-01-30 15:07:40 +00:00
|
|
|
if (diffTime < 0.0) {
|
2015-06-30 02:54:59 +00:00
|
|
|
diffTime += mAnim->mDuration;
|
2019-01-30 15:07:40 +00:00
|
|
|
}
|
|
|
|
if( diffTime > 0) {
|
2015-06-30 02:54:59 +00:00
|
|
|
float factor = float( (time - key.mTime) / diffTime);
|
|
|
|
presentPosition = key.mValue + (nextKey.mValue - key.mValue) * factor;
|
2019-01-30 15:07:40 +00:00
|
|
|
} else {
|
2015-06-30 02:54:59 +00:00
|
|
|
presentPosition = key.mValue;
|
|
|
|
}
|
|
|
|
|
2016-04-06 15:28:09 +00:00
|
|
|
std::get<0>(mLastPositions[a]) = frame;
|
2015-06-30 02:54:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// ******** Rotation *********
|
|
|
|
aiQuaternion presentRotation( 1, 0, 0, 0);
|
2019-01-30 15:07:40 +00:00
|
|
|
if( channel->mNumRotationKeys > 0) {
|
2016-04-06 15:28:09 +00:00
|
|
|
unsigned int frame = (time >= mLastTime) ? std::get<1>(mLastPositions[a]) : 0;
|
2019-01-30 15:07:40 +00:00
|
|
|
while( frame < channel->mNumRotationKeys - 1) {
|
|
|
|
if (time < channel->mRotationKeys[frame + 1].mTime) {
|
2015-06-30 02:54:59 +00:00
|
|
|
break;
|
2019-01-30 15:07:40 +00:00
|
|
|
}
|
|
|
|
++frame;
|
2015-06-30 02:54:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// interpolate between this frame's value and next frame's value
|
|
|
|
unsigned int nextFrame = (frame + 1) % channel->mNumRotationKeys;
|
|
|
|
const aiQuatKey& key = channel->mRotationKeys[frame];
|
|
|
|
const aiQuatKey& nextKey = channel->mRotationKeys[nextFrame];
|
|
|
|
double diffTime = nextKey.mTime - key.mTime;
|
2019-01-30 15:07:40 +00:00
|
|
|
if (diffTime < 0.0) {
|
2015-06-30 02:54:59 +00:00
|
|
|
diffTime += mAnim->mDuration;
|
2019-01-30 15:07:40 +00:00
|
|
|
}
|
|
|
|
if( diffTime > 0) {
|
2015-06-30 02:54:59 +00:00
|
|
|
float factor = float( (time - key.mTime) / diffTime);
|
|
|
|
aiQuaternion::Interpolate( presentRotation, key.mValue, nextKey.mValue, factor);
|
2019-01-30 15:07:40 +00:00
|
|
|
} else {
|
2015-06-30 02:54:59 +00:00
|
|
|
presentRotation = key.mValue;
|
|
|
|
}
|
|
|
|
|
2016-04-06 15:28:09 +00:00
|
|
|
std::get<1>(mLastPositions[a]) = frame;
|
2015-06-30 02:54:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// ******** Scaling **********
|
|
|
|
aiVector3D presentScaling( 1, 1, 1);
|
2019-01-30 15:07:40 +00:00
|
|
|
if( channel->mNumScalingKeys > 0) {
|
2016-04-06 15:28:09 +00:00
|
|
|
unsigned int frame = (time >= mLastTime) ? std::get<2>(mLastPositions[a]) : 0;
|
2019-01-30 15:07:40 +00:00
|
|
|
while( frame < channel->mNumScalingKeys - 1) {
|
|
|
|
if (time < channel->mScalingKeys[frame + 1].mTime) {
|
2015-06-30 02:54:59 +00:00
|
|
|
break;
|
2019-01-30 15:07:40 +00:00
|
|
|
}
|
|
|
|
++frame;
|
2015-06-30 02:54:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: (thom) interpolation maybe? This time maybe even logarithmic, not linear
|
|
|
|
presentScaling = channel->mScalingKeys[frame].mValue;
|
2016-04-06 15:28:09 +00:00
|
|
|
std::get<2>(mLastPositions[a]) = frame;
|
2015-06-30 02:54:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// build a transformation matrix from it
|
|
|
|
aiMatrix4x4& mat = mTransforms[a];
|
|
|
|
mat = aiMatrix4x4( presentRotation.GetMatrix());
|
|
|
|
mat.a1 *= presentScaling.x; mat.b1 *= presentScaling.x; mat.c1 *= presentScaling.x;
|
|
|
|
mat.a2 *= presentScaling.y; mat.b2 *= presentScaling.y; mat.c2 *= presentScaling.y;
|
|
|
|
mat.a3 *= presentScaling.z; mat.b3 *= presentScaling.z; mat.c3 *= presentScaling.z;
|
|
|
|
mat.a4 = presentPosition.x; mat.b4 = presentPosition.y; mat.c4 = presentPosition.z;
|
|
|
|
}
|
|
|
|
|
|
|
|
mLastTime = time;
|
|
|
|
}
|