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