Chaste Release::3.1
MutableMesh.hpp
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 #ifndef MUTABLEMESH_HPP_
00037 #define MUTABLEMESH_HPP_
00038 
00039 #include "ChasteSerialization.hpp"
00040 #include <boost/serialization/base_object.hpp>
00041 
00042 #include "TetrahedralMesh.hpp"
00043 #include "NodeMap.hpp"
00044 
00048 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM>
00049 class MutableMesh : public TetrahedralMesh<ELEMENT_DIM, SPACE_DIM>
00050 {
00052     friend class boost::serialization::access;
00053 
00064     template<class Archive>
00065     void serialize(Archive & archive, const unsigned int version)
00066     {
00067         archive & boost::serialization::base_object<TetrahedralMesh<ELEMENT_DIM, SPACE_DIM> >(*this);
00068 
00069         // Do a remesh after archiving has finished to get right number of boundary nodes etc.
00070         // (strictly only relevant for load - but doesn't take long in the scheme of things.)
00071         // NOTE - Subclasses must archive their member variables BEFORE calling this method.
00072         NodeMap map(this->GetNumNodes());
00073         this->ReMesh(map);
00074         assert(map.IsIdentityMap()); // Otherwise the mesh will get VERY confused.
00075     }
00076 
00077 protected:
00078 
00083     std::vector<unsigned> mDeletedElementIndices;
00084 
00089     std::vector<unsigned> mDeletedBoundaryElementIndices;
00090 
00095     std::vector<unsigned> mDeletedNodeIndices;
00096 
00098     bool mAddedNodes;
00099 
00100 private:
00101 
00102 #define COVERAGE_IGNORE
00103 
00110     bool CheckIsVoronoi(Element<ELEMENT_DIM, SPACE_DIM>* pElement, double maxPenetration);
00111 #undef COVERAGE_IGNORE
00112 
00113 public:
00114 
00118     MutableMesh();
00119 
00125     MutableMesh(std::vector<Node<SPACE_DIM> *> nodes);
00126 
00130     virtual ~MutableMesh();
00131 
00135     void Clear();
00136 
00140     unsigned GetNumNodes() const;
00141 
00145     unsigned GetNumElements() const;
00146 
00150     unsigned GetNumBoundaryElements() const;
00151 
00153 
00160     void RescaleMeshFromBoundaryNode(ChastePoint<1> updatedPoint, unsigned boundaryNodeIndex);
00161 
00169     virtual unsigned AddNode(Node<SPACE_DIM>* pNewNode);
00170 
00179     virtual void SetNode(unsigned index, ChastePoint<SPACE_DIM> point, bool concreteMove=true);
00180 
00190     void MoveMergeNode(unsigned index, unsigned targetIndex, bool concreteMove=true);
00191 
00192 #define COVERAGE_IGNORE
00193 
00199     virtual void DeleteNode(unsigned index);
00200 #undef COVERAGE_IGNORE
00201 
00202 #define COVERAGE_IGNORE
00203 
00211     void DeleteNodePriorToReMesh(unsigned index);
00212 #undef COVERAGE_IGNORE
00213 
00220     unsigned RefineElement(Element<ELEMENT_DIM,SPACE_DIM>* pElement, ChastePoint<SPACE_DIM> point);
00221 
00234     void DeleteBoundaryNodeAt(unsigned index);
00235 
00236 #define COVERAGE_IGNORE
00237 
00243     void ReIndex(NodeMap& map);
00244 #undef COVERAGE_IGNORE
00245 
00246 #define COVERAGE_IGNORE
00247 
00252     virtual void ReMesh(NodeMap& map);
00253 #undef COVERAGE_IGNORE
00254 
00255 
00256 #define COVERAGE_IGNORE
00257 
00261     void ReMesh();
00262 #undef COVERAGE_IGNORE
00263 
00264 #define COVERAGE_IGNORE
00265 
00273     bool CheckIsVoronoi(double maxPenetration=0.0);
00274 #undef COVERAGE_IGNORE
00275 };
00276 
00277 #include "SerializationExportWrapper.hpp"
00278 EXPORT_TEMPLATE_CLASS_ALL_DIMS(MutableMesh)
00279 
00280 #endif /*MUTABLEMESH_HPP_*/