DistanceMapCalculator.hpp

00001 /*
00002 
00003 Copyright (C) University of Oxford, 2005-2010
00004 
00005 University of Oxford means the Chancellor, Masters and Scholars of the
00006 University of Oxford, having an administrative office at Wellington
00007 Square, Oxford OX1 2JD, UK.
00008 
00009 This file is part of Chaste.
00010 
00011 Chaste is free software: you can redistribute it and/or modify it
00012 under the terms of the GNU Lesser General Public License as published
00013 by the Free Software Foundation, either version 2.1 of the License, or
00014 (at your option) any later version.
00015 
00016 Chaste is distributed in the hope that it will be useful, but WITHOUT
00017 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
00018 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
00019 License for more details. The offer of Chaste under the terms of the
00020 License is subject to the License being interpreted in accordance with
00021 English Law and subject to any action against the University of Oxford
00022 being under the jurisdiction of the English Courts.
00023 
00024 You should have received a copy of the GNU Lesser General Public License
00025 along with Chaste. If not, see <http://www.gnu.org/licenses/>.
00026 
00027 */
00028 #ifndef DISTANCEMAPCALCULATOR_HPP_
00029 #define DISTANCEMAPCALCULATOR_HPP_
00030 
00031 #include <vector>
00032 #include <queue>
00033 
00034 #include "UblasIncludes.hpp"
00035 #include "AbstractTetrahedralMesh.hpp"
00036 
00044 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM>
00045 class DistanceMapCalculator
00046 {
00047 private:
00048     friend class TestDistanceMapCalculator;
00049 
00051     AbstractTetrahedralMesh<ELEMENT_DIM, SPACE_DIM>& mrMesh;
00053     unsigned mNumNodes;
00055     unsigned mLo;
00057     unsigned mHi;
00059     bool mWorkOnEntireMesh;
00061     unsigned *mNumHalosPerProcess;
00063     std::vector<unsigned> mHaloNodeIndices;
00065     unsigned mRoundCounter;
00067     unsigned mPopCounter;
00069     unsigned mTargetNodeIndex;
00071     bool mSingleTarget;
00073     c_vector<double, SPACE_DIM> mTargetNodePoint;
00074     
00081     std::priority_queue<std::pair<double, unsigned> > mActivePriorityNodeIndexQueue;
00082 
00091     bool WorkOnLocalQueue(std::vector<double>& rNodeDistances);
00092 
00102     bool UpdateQueueFromRemote(std::vector<double>& rNodeDistances);
00103 
00110     void PushLocal(double priority, unsigned nodeIndex)
00111     {
00112 
00113         if (mLo<=nodeIndex && nodeIndex<mHi)
00114         {
00115             //Push a negative priority so that the lowest one (nearest the surface) is popped first
00116             mActivePriorityNodeIndexQueue.push(std::pair<double, unsigned>(-priority, nodeIndex));
00117         }
00118     }
00119 
00120 public:
00121 
00127     DistanceMapCalculator(AbstractTetrahedralMesh<ELEMENT_DIM, SPACE_DIM>& rMesh);
00131     ~DistanceMapCalculator()
00132     {
00133         delete [] mNumHalosPerProcess;
00134     }
00135 
00142     void ComputeDistanceMap(const std::vector<unsigned>& rSourceNodeIndices,
00143                             std::vector<double>& rNodeDistances);
00151     double SingleDistance(unsigned sourceNodeIndex, unsigned destinationNodeIndex);
00152                             
00153 };
00154 
00155 #endif /*DISTANCEMAPCALCULATOR_HPP_*/

Generated on Mon Nov 1 12:35:23 2010 for Chaste by  doxygen 1.5.5