Chaste Release::3.1
RepulsionForce.cpp
00001 /*
00002 
00003 Copyright (c) 2005-2012, University of Oxford.
00004 All rights reserved.
00005 
00006 University of Oxford means the Chancellor, Masters and Scholars of the
00007 University of Oxford, having an administrative office at Wellington
00008 Square, Oxford OX1 2JD, UK.
00009 
00010 This file is part of Chaste.
00011 
00012 Redistribution and use in source and binary forms, with or without
00013 modification, are permitted provided that the following conditions are met:
00014  * Redistributions of source code must retain the above copyright notice,
00015    this list of conditions and the following disclaimer.
00016  * Redistributions in binary form must reproduce the above copyright notice,
00017    this list of conditions and the following disclaimer in the documentation
00018    and/or other materials provided with the distribution.
00019  * Neither the name of the University of Oxford nor the names of its
00020    contributors may be used to endorse or promote products derived from this
00021    software without specific prior written permission.
00022 
00023 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
00024 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00025 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00026 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
00027 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
00028 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
00029 GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
00030 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00031 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
00032 OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00033 
00034 */
00035 
00036 #include "RepulsionForce.hpp"
00037 
00038 template<unsigned DIM>
00039 RepulsionForce<DIM>::RepulsionForce()
00040    : GeneralisedLinearSpringForce<DIM>()
00041 {
00042 }
00043 
00044 template<unsigned DIM>
00045 void RepulsionForce<DIM>::AddForceContribution(std::vector<c_vector<double, DIM> >& rForces,
00046                                                AbstractCellPopulation<DIM>& rCellPopulation)
00047 {
00048     // Throw an exception message if not using a NodeBasedCellPopulation
00049     if (dynamic_cast<NodeBasedCellPopulation<DIM>*>(&rCellPopulation) == NULL)
00050     {
00051         EXCEPTION("RepulsionForce is to be used with a NodeBasedCellPopulation only");
00052     }
00053 
00054     std::set< std::pair<Node<DIM>*, Node<DIM>* > >& r_node_pairs = (static_cast<NodeBasedCellPopulation<DIM>*>(&rCellPopulation))->rGetNodePairs();
00055 
00056     for (typename std::set< std::pair<Node<DIM>*, Node<DIM>* > >::iterator iter = r_node_pairs.begin();
00057         iter != r_node_pairs.end();
00058         iter++)
00059     {
00060         std::pair<Node<DIM>*, Node<DIM>* > pair = *iter;
00061 
00062         unsigned node_a_index = pair.first->GetIndex();
00063         unsigned node_b_index = pair.second->GetIndex();
00064 
00065         // Get the node locations
00066         c_vector<double, DIM> node_a_location = rCellPopulation.GetNode(node_a_index)->rGetLocation();
00067         c_vector<double, DIM> node_b_location =  rCellPopulation.GetNode(node_b_index)->rGetLocation();
00068 
00069         // Get the node radii
00070         double node_a_radius = dynamic_cast<NodeBasedCellPopulation<DIM>*>(&rCellPopulation)->rGetMesh().GetCellRadius(node_a_index);
00071         double node_b_radius = dynamic_cast<NodeBasedCellPopulation<DIM>*>(&rCellPopulation)->rGetMesh().GetCellRadius(node_b_index);
00072 
00073         // Get the unit vector parallel to the line joining the two nodes
00074         c_vector<double, DIM> unit_difference;
00075 
00076         unit_difference = node_b_location - node_a_location;
00077 
00078         // Calculate the value of the rest length
00079         double rest_length = node_a_radius+node_b_radius;
00080         if (norm_2(unit_difference) < rest_length)
00081         {
00082             // Calculate the force between nodes
00083             c_vector<double, DIM> force = this->CalculateForceBetweenNodes(node_a_index, node_b_index, rCellPopulation);
00084             for (unsigned j=0; j<DIM; j++)
00085             {
00086                 assert(!std::isnan(force[j]));
00087             }
00088             // Add the force contribution to each node
00089             rForces[node_a_index] += force;
00090             rForces[node_b_index] -= force;
00091         }
00092     }
00093 }
00094 
00095 template<unsigned DIM>
00096 void RepulsionForce<DIM>::OutputForceParameters(out_stream& rParamsFile)
00097 {
00098     // Call direct parent class
00099     GeneralisedLinearSpringForce<DIM>::OutputForceParameters(rParamsFile);
00100 }
00101 
00103 // Explicit instantiation
00105 
00106 template class RepulsionForce<1>;
00107 template class RepulsionForce<2>;
00108 template class RepulsionForce<3>;
00109 
00110 // Serialization for Boost >= 1.36
00111 #include "SerializationExportWrapperForCpp.hpp"
00112 EXPORT_TEMPLATE_CLASS_SAME_DIMS(RepulsionForce)