Performs centroid-based sorting of abstract set along the given axis (X - 0, Y - 1, Z - 2) using std::sort. Uses introsort algorithm which guarantees O(n log n) complexity.
More...
|
| | BVH_QuickSorter (const int theAxis=0) |
| | Creates new BVH quick sorter for the given axis.
|
| void | Perform (BVH_Set< T, N > *theSet) override |
| | Sorts the set.
|
| void | Perform (BVH_Set< T, N > *theSet, const int theStart, const int theFinal) override |
| | Sorts the given (inclusive) range in the set.
|
| | BVH_Sorter () |
| | Performs default initialization.
|
| virtual | ~BVH_Sorter ()=default |
| | Releases resources of BVH sorter.
|
| bool | IsParallel () const |
| | Returns parallel flag.
|
| void | SetParallel (const bool isParallel) |
| | Set parallel flag controlling possibility of parallel execution.
|
template<class T, int N>
class BVH_QuickSorter< T, N >
Performs centroid-based sorting of abstract set along the given axis (X - 0, Y - 1, Z - 2) using std::sort. Uses introsort algorithm which guarantees O(n log n) complexity.