An axis-aligned bounding box volume hierarchy for dune grids. More...
#include <vector>
#include <array>
#include <algorithm>
#include <memory>
#include <numeric>
#include <type_traits>
#include <iostream>
#include <dune/common/promotiontraits.hh>
#include <dune/common/timer.hh>
#include <dune/common/fvector.hh>
Go to the source code of this file.
An axis-aligned bounding box volume hierarchy for dune grids.
Dumux implementation of an AABB tree Inspired by the AABB tree implementation in DOLFIN by Anders Logg which has the following license info: DOLFIN is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
Classes | |
class | Dumux::BoundingBoxTree< GeometricEntitySet > |
An axis-aligned bounding box volume tree implementation. More... | |
Namespaces | |
namespace | Dumux |
Functions | |
template<class ctype , int dimworld, typename std::enable_if_t< dimworld==3, int > = 0> | |
bool | Dumux::intersectsPointBoundingBox (const Dune::FieldVector< ctype, dimworld > &point, const ctype *b) |
Check whether a point is intersectin a bounding box (dimworld == 3) More... | |
template<int dimworld, class ctypea , class ctypeb , typename std::enable_if_t< dimworld==3, int > = 0> | |
bool | Dumux::intersectsBoundingBoxBoundingBox (const ctypea *a, const ctypeb *b) |
Check whether a bounding box is intersecting another bounding box (dimworld == 3) More... | |