DFT-FE 1.1.0-pre
Density Functional Theory With Finite-Elements
|
A class template to perform RTreeBox based searching on overlap of boxes. More...
#include <RTreeBox.h>
Public Types | |
using | BPoint = BG::model::point<double, dim, BG::cs::cartesian> |
using | BBox = BG::model::box<BPoint> |
using | BBoxI = std::pair<BBox, size_type> |
using | BRTreeBoxI = BGI::rtree<BBoxI, BGI::quadratic<M>> |
Public Member Functions | |
RTreeBox (std::vector< std::shared_ptr< const Cell< dim > > > sourceCells) | |
Constructor. | |
std::vector< std::vector< size_type > > | getOverlappingCellIds (std::vector< std::shared_ptr< const Cell< dim > > > queryCells) |
Private Attributes | |
BRTreeBoxI | d_rtree |
A class template to perform RTreeBox based searching on overlap of boxes.
dim | Dimension of the box |
M | maximum allowable nodes in a branch of RTreeBox (i.e., maximum number of child nodes a parent node can have) |
using dftfe::utils::RTreeBox< dim, M >::BBox = BG::model::box<BPoint> |
using dftfe::utils::RTreeBox< dim, M >::BBoxI = std::pair<BBox, size_type> |
using dftfe::utils::RTreeBox< dim, M >::BPoint = BG::model::point<double, dim, BG::cs::cartesian> |
using dftfe::utils::RTreeBox< dim, M >::BRTreeBoxI = BGI::rtree<BBoxI, BGI::quadratic<M>> |
dftfe::utils::RTreeBox< dim, M >::RTreeBox | ( | std::vector< std::shared_ptr< const Cell< dim > > > | sourceCells | ) |
Constructor.
std::vector< std::vector< size_type > > dftfe::utils::RTreeBox< dim, M >::getOverlappingCellIds | ( | std::vector< std::shared_ptr< const Cell< dim > > > | queryCells | ) |
|
private |