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 00029 00030 #ifndef CHASTECUBOID_HPP_ 00031 #define CHASTECUBOID_HPP_ 00032 00033 #include "AbstractChasteRegion.hpp" 00034 #include "ChastePoint.hpp" 00035 00036 00042 template <unsigned SPACE_DIM> 00043 class ChasteCuboid : public AbstractChasteRegion<SPACE_DIM> 00044 { 00045 private: 00046 00048 ChastePoint<SPACE_DIM> mLowerCorner; 00049 00051 ChastePoint<SPACE_DIM> mUpperCorner; 00052 00053 public: 00054 00061 ChasteCuboid(ChastePoint<SPACE_DIM>& rLowerPoint, ChastePoint<SPACE_DIM>& rUpperPoint) 00062 : mLowerCorner(rLowerPoint), 00063 mUpperCorner(rUpperPoint) 00064 { 00065 for (unsigned dim=0; dim<SPACE_DIM; dim++) 00066 { 00067 if (mLowerCorner[dim] > mUpperCorner[dim]) 00068 { 00069 EXCEPTION("Attempt to create a cuboid with MinCorner greater than MaxCorner in some dimension"); 00070 } 00071 } 00072 } 00073 00074 00081 bool DoesContain(const ChastePoint<SPACE_DIM>& rPointToCheck) const 00082 { 00083 for (unsigned dim=0; dim<SPACE_DIM; dim++) 00084 { 00085 if (rPointToCheck[dim] < mLowerCorner[dim] - 100*DBL_EPSILON 00086 || mUpperCorner[dim] + 100* DBL_EPSILON < rPointToCheck[dim]) 00087 { 00088 return false; 00089 } 00090 } 00091 return true; 00092 } 00093 00095 const ChastePoint<SPACE_DIM>& rGetUpperCorner() const 00096 { 00097 return mUpperCorner; 00098 } 00100 const ChastePoint<SPACE_DIM>& rGetLowerCorner() const 00101 { 00102 return mLowerCorner; 00103 } 00104 00108 double GetWidth(unsigned rDimension) const 00109 { 00110 assert(rDimension<SPACE_DIM); 00111 return mUpperCorner[rDimension] - mLowerCorner[rDimension]; 00112 } 00113 }; 00114 00115 #endif /*CHASTECUBOID_HPP_*/