|
|
| GenericBoundingBoxTree () |
| | Constructor.
|
| |
|
virtual | ~GenericBoundingBoxTree () |
| | Destructor.
|
| |
|
void | build (const Mesh &mesh, std::size_t tdim) |
| | Build bounding box tree for mesh entities of given dimension.
|
| |
|
void | build (const std::vector< Point > &points) |
| | Build bounding box tree for point cloud.
|
| |
|
std::vector< unsigned int > | compute_collisions (const Point &point) const |
| | Compute all collisions between bounding boxes and Point
|
| |
|
std::pair< std::vector< unsigned int >, std::vector< unsigned int > > | compute_collisions (const GenericBoundingBoxTree &tree) const |
| | Compute all collisions between bounding boxes and BoundingBoxTree
|
| |
|
std::vector< unsigned int > | compute_entity_collisions (const Point &point, const Mesh &mesh) const |
| | Compute all collisions between entities and Point
|
| |
|
std::vector< unsigned int > | compute_process_collisions (const Point &point) const |
| | Compute all collisions between processes and Point
|
| |
|
std::pair< std::vector< unsigned int >, std::vector< unsigned int > > | compute_entity_collisions (const GenericBoundingBoxTree &tree, const Mesh &mesh_A, const Mesh &mesh_B) const |
| | Compute all collisions between entities and BoundingBoxTree
|
| |
|
unsigned int | compute_first_collision (const Point &point) const |
| | Compute first collision between bounding boxes and Point
|
| |
|
unsigned int | compute_first_entity_collision (const Point &point, const Mesh &mesh) const |
| | Compute first collision between entities and Point
|
| |
|
std::pair< unsigned int, double > | compute_closest_entity (const Point &point, const Mesh &mesh) const |
| | Compute closest entity and distance to Point
|
| |
|
std::pair< unsigned int, double > | compute_closest_point (const Point &point) const |
| | Compute closest point and distance to Point
|
| |
|
std::string | str (bool verbose=false) |
| | Print out for debugging.
|
| |
|
|
void | clear () |
| | Clear existing data if any.
|
| |
|
unsigned int | _build (const std::vector< double > &leaf_bboxes, const std::vector< unsigned int >::iterator &begin, const std::vector< unsigned int >::iterator &end, std::size_t gdim) |
| | Build bounding box tree for entities (recursive)
|
| |
|
unsigned int | _build (const std::vector< Point > &points, const std::vector< unsigned int >::iterator &begin, const std::vector< unsigned int >::iterator &end, std::size_t gdim) |
| | Build bounding box tree for points (recursive)
|
| |
|
void | build_point_search_tree (const Mesh &mesh) const |
| | Compute point search tree if not already done.
|
| |
|
void | compute_bbox_of_entity (double *b, const MeshEntity &entity, std::size_t gdim) const |
| | Compute bounding box of mesh entity.
|
| |
|
void | sort_points (std::size_t axis, const std::vector< Point > &points, const std::vector< unsigned int >::iterator &begin, const std::vector< unsigned int >::iterator &middle, const std::vector< unsigned int >::iterator &end) |
| | Sort points along given axis.
|
| |
|
unsigned int | add_bbox (const BBox &bbox, const double *b, std::size_t gdim) |
| | Add bounding box and coordinates.
|
| |
|
const BBox & | get_bbox (unsigned int node) const |
| | Return bounding box for given node.
|
| |
|
unsigned int | num_bboxes () const |
| | Return number of bounding boxes.
|
| |
|
unsigned int | add_point (const BBox &bbox, const Point &point, std::size_t gdim) |
| | Add bounding box and point coordinates.
|
| |
|
bool | is_leaf (const BBox &bbox, unsigned int node) const |
| | Check whether bounding box is a leaf node.
|
| |
|
virtual std::size_t | gdim () const =0 |
| | Return geometric dimension.
|
| |
|
virtual const double * | get_bbox_coordinates (unsigned int node) const =0 |
| | Return bounding box coordinates for node.
|
| |
|
virtual bool | point_in_bbox (const double *x, unsigned int node) const =0 |
| | Check whether point (x) is in bounding box (node)
|
| |
|
virtual bool | bbox_in_bbox (const double *a, unsigned int node) const =0 |
| | Check whether bounding box (a) collides with bounding box (node)
|
| |
|
virtual double | compute_squared_distance_bbox (const double *x, unsigned int node) const =0 |
| | Compute squared distance between point and bounding box.
|
| |
|
virtual double | compute_squared_distance_point (const double *x, unsigned int node) const =0 |
| | Compute squared distance between point and point.
|
| |
|
virtual void | compute_bbox_of_bboxes (double *bbox, std::size_t &axis, const std::vector< double > &leaf_bboxes, const std::vector< unsigned int >::iterator &begin, const std::vector< unsigned int >::iterator &end)=0 |
| | Compute bounding box of bounding boxes.
|
| |
|
virtual void | compute_bbox_of_points (double *bbox, std::size_t &axis, const std::vector< Point > &points, const std::vector< unsigned int >::iterator &begin, const std::vector< unsigned int >::iterator &end)=0 |
| | Compute bounding box of points.
|
| |
|
virtual void | sort_bboxes (std::size_t axis, const std::vector< double > &leaf_bboxes, const std::vector< unsigned int >::iterator &begin, const std::vector< unsigned int >::iterator &middle, const std::vector< unsigned int >::iterator &end)=0 |
| | Sort leaf bounding boxes along given axis.
|
| |
|
void | tree_print (std::stringstream &s, unsigned int i) |
| | Print out recursively, for debugging.
|
| |
|
|
static void | _compute_collisions (const GenericBoundingBoxTree &tree, const Point &point, unsigned int node, std::vector< unsigned int > &entities, const Mesh *mesh) |
| |
|
static void | _compute_collisions (const GenericBoundingBoxTree &A, const GenericBoundingBoxTree &B, unsigned int node_A, unsigned int node_B, std::vector< unsigned int > &entities_A, std::vector< unsigned int > &entities_B, const Mesh *mesh_A, const Mesh *mesh_B) |
| |
|
static unsigned int | _compute_first_collision (const GenericBoundingBoxTree &tree, const Point &point, unsigned int node) |
| |
|
static unsigned int | _compute_first_entity_collision (const GenericBoundingBoxTree &tree, const Point &point, unsigned int node, const Mesh &mesh) |
| |
|
static void | _compute_closest_entity (const GenericBoundingBoxTree &tree, const Point &point, unsigned int node, const Mesh &mesh, unsigned int &closest_entity, double &R2) |
| |
|
static void | _compute_closest_point (const GenericBoundingBoxTree &tree, const Point &point, unsigned int node, unsigned int &closest_point, double &R2) |
| |
Base class for bounding box implementations (envelope-letter design)
