ChasteCuboid.cpp

00001 /*
00002 
00003 Copyright (C) University of Oxford, 2005-2009
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 #include "ChasteCuboid.hpp"
00030 #include "Exception.hpp"
00031 
00032 ChasteCuboid::ChasteCuboid(ChastePoint<3>& rPointA, ChastePoint<3>& rPointB) : mrPointA(rPointA), mrPointB(rPointB)
00033 {
00034     for (unsigned dim=0; dim<3; dim++)
00035     {
00036         if (mrPointA[dim] > mrPointB[dim])
00037         {
00038             EXCEPTION("Attempt to create a cuboid with MinCorner greater than MaxCorner in some dimension");
00039         }
00040     }
00041 }
00042 
00043 bool ChasteCuboid::DoesContain(const ChastePoint<3U>& rPointToCheck)
00044 {
00045     bool inside = true;
00046     for (unsigned dim=0; dim<3; dim++)
00047     {
00048         if (rPointToCheck[dim] < mrPointA[dim] - 100*DBL_EPSILON
00049             || mrPointB[dim] + 100* DBL_EPSILON < rPointToCheck[dim])
00050         {
00051             inside = false;
00052             break;
00053         }
00054     }
00055     return inside;
00056 }
00057 
00058 bool ChasteCuboid::DoesContain(const ChastePoint<2U>& rPointToCheck)
00059 {
00060 //    EXCEPTION("Wrong argument type in ChasteCuboid::DoesContain. Can only be used in 3D");
00061     bool inside = true;
00062     for (unsigned dim=0; dim<2; dim++)
00063     {
00064         if (rPointToCheck[dim] < mrPointA[dim] - 100*DBL_EPSILON
00065             || mrPointB[dim] + 100* DBL_EPSILON < rPointToCheck[dim])
00066         {
00067             inside = false;
00068             break;
00069         }
00070     }
00071     return inside;
00072 }
00073 
00074 bool ChasteCuboid::DoesContain(const ChastePoint<1U>& rPointToCheck)
00075 {
00076 //    EXCEPTION("Wrong argument type in ChasteCuboid::DoesContain. Can only be used in 3D");
00077     bool inside = true;
00078     for (unsigned dim=0; dim<1; dim++)
00079     {
00080         if (rPointToCheck[dim] < mrPointA[dim] - 100*DBL_EPSILON
00081             || mrPointB[dim] + 100* DBL_EPSILON < rPointToCheck[dim])
00082         {
00083             inside = false;
00084             break;
00085         }
00086     }
00087     return inside;
00088 }

Generated on Tue Aug 4 16:10:22 2009 for Chaste by  doxygen 1.5.5