|
| template<typename T, typename ForeachFn> |
| static int | blender::kdtree::calc_duplicates_impl (const KDTreeNew< T > &tree, const typename T::base_type range, const MutableSpan< int > duplicates, const ForeachFn foreach_index) |
| template<typename T> |
| int | blender::kdtree::calc_duplicates (const KDTreeNew< T > &tree, typename T::base_type range, Span< int > visit_order, MutableSpan< int > duplicates) |
| template<typename T> |
| int | blender::kdtree::calc_duplicates (const KDTreeNew< T > &tree, typename T::base_type range, const IndexMask &visit_order, MutableSpan< int > duplicates) |
| template int | blender::kdtree::calc_duplicates (const KDTreeNew< float2 > &, float, Span< int >, MutableSpan< int >) |
| template int | blender::kdtree::calc_duplicates (const KDTreeNew< float3 > &, float, Span< int >, MutableSpan< int >) |
| template int | blender::kdtree::calc_duplicates (const KDTreeNew< float2 > &, float, const IndexMask &, MutableSpan< int >) |
| template int | blender::kdtree::calc_duplicates (const KDTreeNew< float3 > &, float, const IndexMask &, MutableSpan< int >) |
A KD-tree for nearest neighbor search, which started from the nanoflann library and has since been rewritten around Blender's own containers, threading and math. The node layout and the way a search walks it are still recognizably nanoflann's, which is where the copyright above comes from.
Definition in file kdtree.cc.