QuadTree用于2D粒子系统

Question

我编写了一个四叉树来检测2D游戏中粒子之间的碰撞。代码有效，但速度不是很快。特别是retrieve（）函数。作为c ++的初学者，如果你有优化我的代码的技巧，它会很好。

QuadTree.h

class QuadTree{
public:
    QuadTree();
    QuadTree(int level, int posX, int posY, int width, int height);
    virtual ~QuadTree();

    void clearQuadTree();
    void split();
    void insertObject(Particle particle, int indexParticule, Particle *particles);
    int getIndex(Particle particule);
    void retrieve(Particle particle, std::vector<int>& particles);
    void displayQuad(Window *window, Camera *camera);

    const static int MAX_OBJECTS = 10;
    const static int MAX_LEVELS = 30;

    std::vector<int> mObjects;
    std::vector<QuadTree> mNodes;
    int mLevel;

    // bounds
    int mPosX;
    int mPosY;
    int mWidth;
    int mHeight;
};

QuadTree.cpp

void QuadTree::clearQuadTree(){
    mObjects.clear();
    while(!mNodes.empty())
        mNodes.pop_back();
    for(int i=0;i<mNodes.size();i++)
        mNodes[i].clearQuadTree();}

void QuadTree::split(){
    int subWidth = mWidth / 2;
    int subHeight = mHeight / 2;
    mNodes.push_back(QuadTree(mLevel+1, mPosX + subWidth, mPosY, subWidth, subHeight));
    mNodes.push_back(QuadTree(mLevel+1, mPosX, mPosY, subWidth, subHeight));
    mNodes.push_back(QuadTree(mLevel+1, mPosX, mPosY + subHeight, subWidth, subHeight));
    mNodes.push_back(QuadTree(mLevel+1, mPosX + subWidth, mPosY + subHeight, subWidth, subHeight));}

void QuadTree::insertObject(Particle particle, int indexParticule, Particle *particles){
    if(!mNodes.empty()){
        int index = getIndex(particle);

        if(index != -1) {
            mNodes[index].insertObject(particle, indexParticule, particles);
            return;
        }
    }

    mObjects.push_back(indexParticule);

    if(mObjects.size() > MAX_OBJECTS && mLevel < MAX_LEVELS) {
        if(mNodes.empty())
            split();

        // moves object in new sub-nodes
        std::vector<int>::iterator i = mObjects.begin();
        while(i != mObjects.end()){
            int index = getIndex(particles[*i]);
            if (index != -1){
                mNodes[index].insertObject(particles[*i], *i, particles);
                mObjects.erase(i);
            }
            else
                i++;
        }

    }
}

void QuadTree::retrieve(Particle particle, std::vector<int>& particles){

    // add objects in current node
    for(int i=0; i<mObjects.size(); i++)
        particles.push_back(mObjects[i]);


    // add objects in sub-nodes
    int index = getIndex(particle);
    if(index == -1 )
        for(int i=0; i<mNodes.size(); i++)
            mNodes[i].retrieve(particle, particles);
    else if(!mNodes.empty())
        mNodes[index].retrieve(particle, particles);
}

使用该代码，我的2D游戏中只能达到约300个粒子。

编辑：

int QuadTree::getIndex(Particle particle){
    int index = -1;
    int verticalMidpoint = mPosX + mWidth/2;
    int horizontalMidpoint = mPosY + mHeight/2;

    // Object can completely fit within the top quadrants
    bool topQuadrant = (particle.mPositionY-(particle.RADIUS_PARTICLE)>horizontalMidpoint);
    // Object can completely fit within the bottom quadrants
    bool bottomQuadrant = (particle.mPositionY+(particle.RADIUS_PARTICLE)<horizontalMidpoint);

    // Object can completely fit within the left quadrants
    if(particle.mPositionX + (particle.RADIUS_PARTICLE)<verticalMidpoint){
        if(topQuadrant)
            index = 2;
        else if(bottomQuadrant)
            index = 1;
    }
    // Object can completely fit within the right quadrants
    else if(particle.mPositionX - (particle.RADIUS_PARTICLE)>verticalMidpoint){
        if (topQuadrant)
            index = 3;
        else if (bottomQuadrant)
            index = 0;
    }

    return index;}