Reference documentation for deal.II version 9.6.0
|
#include <deal.II/arborx/access_traits.h>
Public Member Functions | |
template<int dim, typename Number > | |
BoundingBoxNearestPredicate (const std::vector<::BoundingBox< dim, Number > > &bounding_boxes, const unsigned int n_nearest_neighbors) | |
unsigned int | get_n_nearest_neighbors () const |
const ::BoundingBox< 3, float > & | get (unsigned int i) const |
std::size_t | size () const |
Private Attributes | |
unsigned int | n_nearest_neighbors |
std::vector<::BoundingBox< 3, float > > | bounding_boxes |
This class is used by ArborXWrappers::BVH to determine for given bounding boxes which are the nearest bounding boxes/points among the ones used to build the ArborXWrappers::BVH.
Definition at line 183 of file access_traits.h.
ArborXWrappers::BoundingBoxNearestPredicate::BoundingBoxNearestPredicate | ( | const std::vector<::BoundingBox< dim, Number > > & | bounding_boxes, |
const unsigned int | n_nearest_neighbors ) |
Constructor. bounding_boxes
is a list of bounding boxes for which are interested in knowing the n_nearest_neighbors
nearest bounding boxes used to build the ArborXWrappers::BVH.
Definition at line 143 of file access_traits.cc.
unsigned int ArborXWrappers::BoundingBoxNearestPredicate::get_n_nearest_neighbors | ( | ) | const |
Return the number of nearest neighbors we are looking for.
Definition at line 153 of file access_traits.cc.
const::BoundingBox< 3, float > & ArborXWrappers::BoundingBoxPredicate::get | ( | unsigned int | i | ) | const |
Return the i
th BoundingBox stored in the object.
Definition at line 146 of file access_traits.cc.
std::size_t ArborXWrappers::BoundingBoxPredicate::size | ( | ) | const |
The number of bounding boxes stored in the structure.
Definition at line 140 of file access_traits.cc.
|
private |
Definition at line 207 of file access_traits.h.
|
privateinherited |
Definition at line 149 of file access_traits.h.