Feel++
0.91.4
|
implements a region-tree for point search in a set of boxes More...
#include <regiontree.hpp>
Classes | |
struct | box_index_type |
Public Types | |
Typedefs | |
typedef node< double >::type | node_type |
typedef std::deque < box_index_type > | box_container_type |
typedef std::vector< const box_index_type * > | pbox_container_type |
typedef std::set< const box_index_type * > | pbox_set_type |
Public Member Functions | |
Constructors, destructor | |
RegionTree () | |
~RegionTree () | |
Accessors | |
size_type | nbBoxes () const |
Methods | |
void | addBox (node_type min, node_type max, size_type id=size_type(-1)) |
void | clear () |
void | findIntersectingBoxes (const node_type &bmin, const node_type &bmax, pbox_set_type &boxlst) |
void | findContainingBoxes (const node_type &bmin, const node_type &bmax, pbox_set_type &boxlst) |
void | findContainedBoxes (const node_type &bmin, const node_type &bmax, pbox_set_type &boxlst) |
void | findBoxesAtPoint (const node_type &P, pbox_set_type &boxlst) |
void | findIntersectingBoxes (const node_type &bmin, const node_type &bmax, std::vector< size_type > &idvec) |
void | findContainingBoxes (const node_type &bmin, const node_type &bmax, std::vector< size_type > &idvec) |
void | findContainedBoxes (const node_type &bmin, const node_type &bmax, std::vector< size_type > &idvec) |
void | findBoxesAtPoint (const node_type &P, std::vector< size_type > &idvec) |
void | dump () |
implements a region-tree for point search in a set of boxes
detail void Feel::RegionTree::addBox | ( | node_type | min, |
node_type | max, | ||
size_type | id = size_type(-1) |
||
) |
add a box in the region tree
min | min coordinates for bounding box |
max | max coordinates for bounding box |
id | id of the element stored in the bounding box |
void Feel::RegionTree::clear | ( | ) | [inline] |
clear the tree