Reference documentation for deal.II version 9.5.0
|
#include <deal.II/arborx/access_traits.h>
Public Member Functions | |
template<int dim, typename Number > | |
PointNearestPredicate (const std::vector<::Point< dim, Number > > &points, const unsigned int n_nearest_neighbors) | |
unsigned int | get_n_nearest_neighbors () const |
const ::Point< 3, float > & | get (unsigned int i) const |
std::size_t | size () const |
Private Attributes | |
unsigned int | n_nearest_neighbors |
std::vector<::Point< 3, float > > | points |
This class defines a predicate used by ArborXWrappers::BVH to determine for given points which are the nearest bounding boxes/points among the ones used to build the ArborXWrappers::BVH.
Definition at line 94 of file access_traits.h.
ArborXWrappers::PointNearestPredicate::PointNearestPredicate | ( | const std::vector<::Point< dim, Number > > & | points, |
const unsigned int | n_nearest_neighbors | ||
) |
Constructor. points
is a list of points for which we are interested in the n_nearest_neighbors
in the ArborXWrappers::BVH bounding boxes/points.
Definition at line 69 of file access_traits.cc.
unsigned int ArborXWrappers::PointNearestPredicate::get_n_nearest_neighbors | ( | ) | const |
Return the number of nearest neighbors we are looking for.
Definition at line 79 of file access_traits.cc.
Return the i
th Point stored in the object.
Definition at line 56 of file access_traits.cc.
std::size_t ArborXWrappers::PointPredicate::size | ( | ) | const |
The number of points stored in the structure.
Definition at line 50 of file access_traits.cc.
|
private |
Definition at line 117 of file access_traits.h.
|
privateinherited |
Definition at line 59 of file access_traits.h.