Chaste  Release::3.4
DistanceMapCalculator.hpp
1 /*
2 
3 Copyright (c) 2005-2016, University of Oxford.
4 All rights reserved.
5 
6 University of Oxford means the Chancellor, Masters and Scholars of the
7 University of Oxford, having an administrative office at Wellington
8 Square, Oxford OX1 2JD, UK.
9 
10 This file is part of Chaste.
11 
12 Redistribution and use in source and binary forms, with or without
13 modification, are permitted provided that the following conditions are met:
14  * Redistributions of source code must retain the above copyright notice,
15  this list of conditions and the following disclaimer.
16  * Redistributions in binary form must reproduce the above copyright notice,
17  this list of conditions and the following disclaimer in the documentation
18  and/or other materials provided with the distribution.
19  * Neither the name of the University of Oxford nor the names of its
20  contributors may be used to endorse or promote products derived from this
21  software without specific prior written permission.
22 
23 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
24 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
27 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
28 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
29 GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
32 OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 
34 */
35 #ifndef DISTANCEMAPCALCULATOR_HPP_
36 #define DISTANCEMAPCALCULATOR_HPP_
37 
38 #include <vector>
39 #include <queue>
40 
41 #include "UblasIncludes.hpp"
42 #include "AbstractTetrahedralMesh.hpp"
43 
51 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM>
53 {
54 private:
55  friend class TestDistanceMapCalculator;
56 
60  unsigned mNumNodes;
62  unsigned mLo;
64  unsigned mHi;
70  std::vector<unsigned> mHaloNodeIndices;
72  unsigned mRoundCounter;
74  unsigned mPopCounter;
76  unsigned mTargetNodeIndex;
80  c_vector<double, SPACE_DIM> mTargetNodePoint;
81 
88  std::priority_queue<std::pair<double, unsigned> > mActivePriorityNodeIndexQueue;
89 
98  bool WorkOnLocalQueue(std::vector<double>& rNodeDistances);
99 
109  bool UpdateQueueFromRemote(std::vector<double>& rNodeDistances);
110 
117  void PushLocal(double priority, unsigned nodeIndex)
118  {
119 
120  if (mLo<=nodeIndex && nodeIndex<mHi)
121  {
122  //Push a negative priority so that the lowest one (nearest the surface) is popped first
123  mActivePriorityNodeIndexQueue.push(std::pair<double, unsigned>(-priority, nodeIndex));
124  }
125  }
126 
127 public:
128 
135 
140  {
141  delete [] mNumHalosPerProcess;
142  }
143 
153  void ComputeDistanceMap(const std::vector<unsigned>& rSourceNodeIndices,
154  std::vector<double>& rNodeDistances);
155 
163  double SingleDistance(unsigned sourceNodeIndex, unsigned destinationNodeIndex);
164 
165 };
166 
167 #endif /*DISTANCEMAPCALCULATOR_HPP_*/
std::priority_queue< std::pair< double, unsigned > > mActivePriorityNodeIndexQueue
AbstractTetrahedralMesh< ELEMENT_DIM, SPACE_DIM > & mrMesh
std::vector< unsigned > mHaloNodeIndices
c_vector< double, SPACE_DIM > mTargetNodePoint
void PushLocal(double priority, unsigned nodeIndex)
bool UpdateQueueFromRemote(std::vector< double > &rNodeDistances)
bool WorkOnLocalQueue(std::vector< double > &rNodeDistances)
void ComputeDistanceMap(const std::vector< unsigned > &rSourceNodeIndices, std::vector< double > &rNodeDistances)
DistanceMapCalculator(AbstractTetrahedralMesh< ELEMENT_DIM, SPACE_DIM > &rMesh)
double SingleDistance(unsigned sourceNodeIndex, unsigned destinationNodeIndex)