boundingboxtreeintersection.hh

Go to the documentation of this file.

/*****************************************************************************
 *   See the file COPYING for full copying permissions.                      *
 *                                                                           *
 *   This program is free software: you can redistribute it and/or modify    *
 *   it under the terms of the GNU General Public License as published by    *
 *   the Free Software Foundation, either version 3 of the License, or       *
 *   (at your option) any later version.                                     *
 *                                                                           *
 *   This program is distributed in the hope that it will be useful,         *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of          *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the           *
 *   GNU General Public License for more details.                            *
 *                                                                           *
 *   You should have received a copy of the GNU General Public License       *
 *   along with this program.  If not, see <http://www.gnu.org/licenses/>.   *
 *****************************************************************************/
#ifndef DUMUX_BOUNDING_BOX_TREE_INTERSECTION_HH
#define DUMUX_BOUNDING_BOX_TREE_INTERSECTION_HH
 
#include <dune/common/fvector.hh>
#include <dune/common/promotiontraits.hh>
 
namespace Dumux {
 
template<class EntitySet0, class EntitySet1>
class BoundingBoxTreeIntersection
{
    enum { dimworld = EntitySet0::dimensionworld };
    using ctype = typename Dune::PromotionTraits<typename EntitySet0::ctype, typename EntitySet1::ctype>::PromotedType;
    using GlobalPosition = Dune::FieldVector<ctype, dimworld>;
 
public:
    template<class Corners>
    explicit BoundingBoxTreeIntersection(std::size_t a,
                                         std::size_t b,
                                         Corners&& c)
    : a_(a)
    , b_(b)
    , corners_(c.begin(), c.end())
    {
        static_assert(int(EntitySet0::dimensionworld) == int(EntitySet1::dimensionworld),
          "Can only store intersections of entity sets with the same world dimension");
    }
 
    std::size_t first() const
    { return a_; }
 
    std::size_t second() const
    { return b_; }
 
    std::vector<GlobalPosition> corners() const
    { return corners_; }
 
    bool cornersMatch(const std::vector<GlobalPosition>& otherCorners) const
    {
        if (otherCorners.size() != corners_.size())
            return false;
 
        const auto eps = 1.5e-7*(corners_[1] - corners_[0]).two_norm();
        for (int i = 0; i < corners_.size(); ++i)
            if ((corners_[i] - otherCorners[i]).two_norm() > eps)
                return false;
 
        return true;
    }
 
private:
    std::size_t a_, b_; 
    std::vector<GlobalPosition> corners_; 
};
 
} // end namespace Dumux
 
#endif