AnimaL

Tutorial

Documentation

---

Documentation

• Overview
• Modules
• Namespace List
• Class Hierarchy
• Alphabetical List
• Compound List
• File List
• Namespace Members
• Compound Members
• File Members
• Examples

---

OctreeEngine.cpp

Go to the documentation of this file.

//
// C++ Implementation: OctreeEngine
//
// Description:
//
//
// Author: François Faure <>, (C) 2004
//
// Copyright: See COPYING file that comes with this distribution
//
//
#include "OctreeEngine.h"
#include <iostream>
using std::cerr;
using std::endl;
#include "ConstrainedVertex.h"



namespace animal
{

namespace octree
{


/*void incrementNumberOfNodes( int& freeNodes, int& constrainedNodes )*/


OctreeEngine::OctreeEngine(Vec3d bboxMin, Vec3d bboxMax, MFVec3f *points, MFVec3f normals, unsigned int nMaxPointsPerCell)
        : Octree(bboxMin, bboxMax, points, normals, nMaxPointsPerCell)
        , _time(0)
{}


OctreeEngine::~OctreeEngine()
{}

void OctreeEngine::init( )
{
    //cerr<<"--------------------------------------------------OctreeEngine::init( )"<<endl;
    v_assign( ConstrainedVertex::VEL, Vec3d(0,1,0) );
    writePositionsTo( ConstrainedVertex::POS );
}

void OctreeEngine::move( double dt )
{
    //cerr<<"==================  OctreeEngine::move, dt = "<< dt << endl;
    _time += dt;
    v_eq_a_plus_alpha_b( ConstrainedVertex::POS, ConstrainedVertex::POS, dt, ConstrainedVertex::VEL );
    readPositionsFrom( ConstrainedVertex::POS );
    movedRecLeaves( root_ );
}

void OctreeEngine::v_eq( int target_value_id, int a)
{
    for( Cell::vertex_width_iterator it( root_ ) ; !it.empty() ; )
    {
        ConstrainedVertex* v = ++it;
        v->setValue(target_value_id,v->value(a));
    }
}

void OctreeEngine::v_assign( int target_value_id, const Vec3d& a)
{
    for( Cell::vertex_width_iterator it( root_ ) ; !it.empty() ; )
    {
        ConstrainedVertex* v = ++it;
        v->setValue(target_value_id,a);
    }
}

void OctreeEngine::v_eq_a_plus_alpha_b( int target, int a, FloatingPointType alpha, int b )
{
    for( Cell::vertex_width_iterator it( root_ ) ; !it.empty() ; )
    {
        ConstrainedVertex* v = ++it;
        //cerr<<"OctreeEngine::v_eq_a_plus_alpha_b, old value= "<< v->value(target) <<endl;
        if( v->isFree() )
        {
            //cerr<<"OctreeEngine::v_eq_a_plus_alpha_b, b = "<<v->value(b)<<endl;
            v->setValue(target, v->value(a) + v->value(b) * alpha );
        }
        else
        {
            v->computeValueFromParents(target);
        }
        //cerr<<"OctreeEngine::v_eq_a_plus_alpha_b, new value= "<< v->value(target) <<endl;
    }
}

void OctreeEngine::readPositionsFrom(int target)
{
    for( Cell::vertex_width_iterator it( root_ ) ; !it.empty() ; )
    {
        ConstrainedVertex* v = ++it;
        if( v->isFree() )
        {
            v->setPosition(v->value(target));
        }
        else
        {
            v->setPosition(v->computePosition());
        }
        //cerr<<"OctreeEngine::move, vertex_width_iterator visits at depth = "<<v->getDepth()<<endl;


        //nVertices++;
    }

}


void OctreeEngine::writePositionsTo(int target)
{
    //     for( read_position_iterator it( root_,target ); !it.empty(); ++it )
    //         ;
    for( Cell::vertex_width_iterator it( root_ ) ; !it.empty() ; )
    {
        ConstrainedVertex* v = ++it;
        if( v->isFree() )
        {
            v->setValue(target,v->getPosition());
        }
        else
        {
            v->computeValueFromParents(target);
        }
        //cerr<<"OctreeEngine::move, vertex_width_iterator visits at depth = "<<v->getDepth()<<endl;


        //nVertices++;
    }

}

}
;

};

---