3 #include <SharedSubTask.h>
4 #include <SharedTaskSequencer.h>
56 std::shared_ptr<SharedTaskSequencer>
ch,
Class representing an Axis Aligned Bounding Box (AABB)
Definition: AABB.h:10
glm::dvec3 const & getMax() const
Get the max value for each coordinate of the axis aligned bounding box.
Definition: AABB.h:109
glm::dvec3 const & getMin() const
Get the min value for each coordinate of the axis aligned bounding box.
Definition: AABB.h:103
AABB * getAABB() override
Obtain this axis aligned bounding box.
Definition: AABB.cpp:214
Definition: FastSAHKDTreeRecountSubTask.h:6
vector< Primitive * >::iterator endPrimitive
Last primitive to be considered by the recount (exclusive)
Definition: FastSAHKDTreeRecountSubTask.h:30
size_t const lossNodes
How many bins use to cound.
Definition: FastSAHKDTreeRecountSubTask.h:34
double const minp
Minimum coordinate of node boundary at corresponding split axis.
Definition: FastSAHKDTreeRecountSubTask.h:17
FastSAHKDTreeRecountSubTask(std::shared_ptr< SharedTaskSequencer > ch, int const splitAxis, double const minp, double const deltap, vector< Primitive * >::iterator beginPrimitive, vector< Primitive * >::iterator endPrimitive, size_t const lossNodes, size_t const lossCases, vector< size_t > &cForward, vector< size_t > &cBackward)
Main constructor for Fast-SAH KDTree forward and backward recounts.
Definition: FastSAHKDTreeRecountSubTask.h:55
void run() override
Implementation of the method to do forward and backward recount.
Definition: FastSAHKDTreeRecountSubTask.h:87
int const splitAxis
The node split axis.
Definition: FastSAHKDTreeRecountSubTask.h:13
vector< Primitive * >::iterator beginPrimitive
First primitive to be considered by the recount (inclusive)
Definition: FastSAHKDTreeRecountSubTask.h:26
vector< size_t > & cForward
Where forward count components must be stored.
Definition: FastSAHKDTreeRecountSubTask.h:42
double const deltap
Difference between maximum and minimum coordinates of node boundaries at corresponding split axis.
Definition: FastSAHKDTreeRecountSubTask.h:22
size_t const lossCases
How many forward and backward count cases (it is, bins + 1)
Definition: FastSAHKDTreeRecountSubTask.h:38
vector< size_t > & cBackward
Where backward count components must be stored.
Definition: FastSAHKDTreeRecountSubTask.h:46
A shared task is said to be a collection of shared sub-tasks. Each shared sub-task can be computed in...
Definition: SharedSubTask.h:16
std::shared_ptr< SharedSubTaskCompletionHandler > ch
The shared sub-task completion handler that handles what must be done after a shared sub-task executi...
Definition: SharedSubTask.h:28