adamantine::RayNearestPredicate Class Reference

Public Member Functions
	RayNearestPredicate (std::vector< Ray< 3 >> const &rays)
std::size_t	size () const
Ray< 3 > const &	get (unsigned int i) const

Private Attributes
std::vector< Ray< 3 > >	_rays

Detailed Description

This class implements a predicate for the intersection of Ray and the first BoundingBox. In ArborX, this is a nearest search between a Ray and the BoundingBoxes.

Definition at line 25 of file RayTracing.cc.

Constructor & Destructor Documentation

RayNearestPredicate()

adamantine::RayNearestPredicate::RayNearestPredicate ( std::vector< Ray< 3 >> const &  rays )

inline

Constructor. points is a list of points which we are interested in knowing if they intersect ArborXWrappers::BVH bounding boxes.

Definition at line 32 of file RayTracing.cc.

Member Function Documentation

get()

Ray<3> const& adamantine::RayNearestPredicate::get ( unsigned int  i ) const

inline

Return the ith Ray stored in the object.

Definition at line 42 of file RayTracing.cc.

size()

std::size_t adamantine::RayNearestPredicate::size ( ) const

inline

Number of rays stored in the structure.

Definition at line 37 of file RayTracing.cc.

Member Data Documentation

_rays

std::vector<Ray<3> > adamantine::RayNearestPredicate::_rays

private

Definition at line 45 of file RayTracing.cc.