DistanceMapCalculator.hpp

/*

Copyright (C) University of Oxford, 2005-2010

University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.

This file is part of Chaste.

Chaste is free software: you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation, either version 2.1 of the License, or
(at your option) any later version.

Chaste is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
License for more details. The offer of Chaste under the terms of the
License is subject to the License being interpreted in accordance with
English Law and subject to any action against the University of Oxford
being under the jurisdiction of the English Courts.

You should have received a copy of the GNU Lesser General Public License
along with Chaste. If not, see <http://www.gnu.org/licenses/>.

*/
#ifndef DISTANCEMAPCALCULATOR_HPP_
#define DISTANCEMAPCALCULATOR_HPP_

#include <vector>
#include <queue>

#include "UblasIncludes.hpp"
#include "AbstractTetrahedralMesh.hpp"

template<unsigned ELEMENT_DIM, unsigned SPACE_DIM>
class DistanceMapCalculator
{
private:
    friend class TestDistanceMapCalculator;

    AbstractTetrahedralMesh<ELEMENT_DIM, SPACE_DIM>& mrMesh;
    unsigned mNumNodes;
    unsigned mLo;
    unsigned mHi;
    bool mWorkOnEntireMesh;
    unsigned *mNumHalosPerProcess;
    std::vector<unsigned> mHaloNodeIndices;
    unsigned mRoundCounter;
    unsigned mPopCounter;
    unsigned mTargetNodeIndex;
    bool mSingleTarget;
    c_vector<double, SPACE_DIM> mTargetNodePoint;
    
    std::priority_queue<std::pair<double, unsigned> > mActivePriorityNodeIndexQueue;

    bool WorkOnLocalQueue(std::vector<double>& rNodeDistances);

    bool UpdateQueueFromRemote(std::vector<double>& rNodeDistances);

    void PushLocal(double priority, unsigned nodeIndex)
    {

        if (mLo<=nodeIndex && nodeIndex<mHi)
        {
            //Push a negative priority so that the lowest one (nearest the surface) is popped first
            mActivePriorityNodeIndexQueue.push(std::pair<double, unsigned>(-priority, nodeIndex));
        }
    }

public:

    DistanceMapCalculator(AbstractTetrahedralMesh<ELEMENT_DIM, SPACE_DIM>& rMesh);
    ~DistanceMapCalculator()
    {
        delete [] mNumHalosPerProcess;
    }

    void ComputeDistanceMap(const std::vector<unsigned>& rSourceNodeIndices,
                            std::vector<double>& rNodeDistances);
    double SingleDistance(unsigned sourceNodeIndex, unsigned destinationNodeIndex);
                            
};

#endif /*DISTANCEMAPCALCULATOR_HPP_*/

---