|
Blender V5.3
|
Public Types | |
| using | value_type = typename T::base_type |
Public Member Functions | |
| TreeBuilder (const Span< T > points, const MutableSpan< int > indices, const int leaf_size, LinearAllocator<> &allocator) | |
| Node * | build (const Span< int > indices, Bounds< T > &r_bounds) |
Static Public Member Functions | |
| static int | node_batch_size (const int points_num, const int leaf_size) |
Static Public Attributes | |
| static constexpr int | dimensions = T::type_length |
| using blender::TreeBuilder< T >::value_type = typename T::base_type |
|
inline |
|
inline |
Definition at line 191 of file kdtree.cc.
References blender::BLI_assert(), blender::BLI_system_thread_count(), blender::threading::max_threads_task(), blender::parallel_build_threads(), and blender::PARALLEL_BUILD_THRESHOLD.
|
inlinestatic |
The approximate number of nodes a tree with points_num points takes. Leaves hold a bit over two thirds of #leaf_size_ points on average, and a tree has one interior node fewer than it has leaves. Measured at 22.6 points per leaf for a leaf size of 32. See BLI_kdtree_performance_test.
|
staticconstexpr |