![]() |
Reference documentation for deal.II version 9.6.0
|
#include <deal.II/arborx/access_traits.h>
Public Member Functions | |
template<int dim, typename Number > | |
SphereNearestPredicate (const std::vector< std::pair<::Point< dim, Number >, Number > > &spheres, const unsigned int n_nearest_neighbors) | |
unsigned int | get_n_nearest_neighbors () const |
const std::pair<::Point< 3, float >, float > & | get (unsigned int) const |
std::size_t | size () const |
Private Attributes | |
unsigned int | n_nearest_neighbors |
std::vector< std::pair<::Point< 3, float >, float > > | spheres |
This class defines a predicate used by ArborXWrappers::BVH to determine, for the given spheres, which are the nearest bounding boxes/points among the ones used to build the ArborXWrappers::BVH.
Definition at line 277 of file access_traits.h.
ArborXWrappers::SphereNearestPredicate::SphereNearestPredicate | ( | const std::vector< std::pair<::Point< dim, Number >, Number > > & | spheres, |
const unsigned int | n_nearest_neighbors ) |
Constructor. spheres
is a list of spheres for which we are interested in the n_nearest_neighbors
in the ArborXWrappers::BVH bounding boxes/points.
Definition at line 202 of file access_traits.cc.
unsigned int ArborXWrappers::SphereNearestPredicate::get_n_nearest_neighbors | ( | ) | const |
Return the number of nearest neighbors we are looking for.
Definition at line 212 of file access_traits.cc.
const std::pair<::Point< 3, float >, float > & ArborXWrappers::SpherePredicate::get | ( | unsigned int | i | ) | const |
Return the i
th sphere stored in the object.
Definition at line 238 of file access_traits.cc.
std::size_t ArborXWrappers::SpherePredicate::size | ( | ) | const |
The number of spheres stored in the structure.
Definition at line 232 of file access_traits.cc.
|
private |
Definition at line 301 of file access_traits.h.
|
privateinherited |
Definition at line 241 of file access_traits.h.