Chaste Release::3.1
|
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 "BoundaryElement.hpp" 00037 00038 #include <cassert> 00039 00041 // Implementation 00043 00044 00045 template <unsigned ELEMENT_DIM, unsigned SPACE_DIM> 00046 BoundaryElement<ELEMENT_DIM, SPACE_DIM>::BoundaryElement() 00047 : AbstractTetrahedralElement<ELEMENT_DIM, SPACE_DIM>() 00048 { 00049 } 00050 00051 00052 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM> 00053 BoundaryElement<ELEMENT_DIM, SPACE_DIM>::BoundaryElement(unsigned index, const std::vector<Node<SPACE_DIM>*>& rNodes) 00054 : AbstractTetrahedralElement<ELEMENT_DIM, SPACE_DIM>(index, rNodes) 00055 { 00056 RegisterWithNodes(); 00057 } 00058 00059 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM> 00060 BoundaryElement<ELEMENT_DIM, SPACE_DIM>::BoundaryElement(unsigned index, Node<SPACE_DIM>* pNode) 00061 : AbstractTetrahedralElement<ELEMENT_DIM,SPACE_DIM>(index) 00062 { 00063 assert(ELEMENT_DIM == 0); 00064 00065 // Store Node pointer 00066 this->mNodes.push_back(pNode); 00067 RegisterWithNodes(); 00068 } 00069 00070 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM> 00071 void BoundaryElement<ELEMENT_DIM, SPACE_DIM>::RegisterWithNodes() 00072 { 00073 for (unsigned i=0; i<this->mNodes.size(); i++) 00074 { 00075 this->mNodes[i]->AddBoundaryElement(this->mIndex); 00076 } 00077 } 00078 00079 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM> 00080 void BoundaryElement<ELEMENT_DIM, SPACE_DIM>::ResetIndex(unsigned index) 00081 { 00082 for (unsigned i=0; i<this->GetNumNodes(); i++) 00083 { 00084 this->mNodes[i]->RemoveBoundaryElement(this->mIndex); 00085 } 00086 this->mIndex = index; 00087 RegisterWithNodes(); 00088 } 00089 00090 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM> 00091 void BoundaryElement<ELEMENT_DIM, SPACE_DIM>::MarkAsDeleted() 00092 { 00093 this->mIsDeleted = true; 00094 // this->mJacobianDeterminant = 0.0; 00095 // Update nodes in this element so they know they are not contained by us 00096 for (unsigned i=0; i<this->GetNumNodes(); i++) 00097 { 00098 this->mNodes[i]->RemoveBoundaryElement(this->mIndex); 00099 } 00100 } 00101 00102 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM> 00103 void BoundaryElement<ELEMENT_DIM, SPACE_DIM>::UpdateNode(const unsigned& rIndex, Node<SPACE_DIM>* pNode) 00104 { 00105 assert(rIndex < this->mNodes.size()); 00106 00107 // Remove it from the node at this location 00108 this->mNodes[rIndex]->RemoveBoundaryElement(this->mIndex); 00109 00110 // Update the node at this location 00111 this->mNodes[rIndex] = pNode; 00112 00113 // Add element to this node 00114 this->mNodes[rIndex]->AddBoundaryElement(this->mIndex); 00115 } 00116 00117 00119 // Explicit instantiation 00121 00122 template class BoundaryElement<0,1>; 00123 template class BoundaryElement<0,2>; 00124 template class BoundaryElement<1,2>; 00125 template class BoundaryElement<0,3>; 00126 template class BoundaryElement<1,3>; 00127 template class BoundaryElement<2,3>;