Searched refs:kdtree_partition (Results 1 – 5 of 5) sorted by relevance
| /dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/thirdparty/diy/vtkmdiy/include/vtkmdiy/ |
| H A D | algorithms.hpp | 118 detail::KDTreePartition<Block,Point> kdtree_partition(dim, points, bins); in kdtree() local
121 reduce(master, assigner, partners, kdtree_partition); in kdtree()
178 detail::KDTreeSamplingPartition<Block,Point> kdtree_partition(dim, points, samples); in kdtree_sampling() local
181 reduce(master, assigner, partners, kdtree_partition); in kdtree_sampling()
|
| /dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/thirdparty/diy/vtkmdiy/include/vtkmdiy/ |
| H A D | algorithms.hpp | 118 detail::KDTreePartition<Block,Point> kdtree_partition(dim, points, bins); in kdtree() local
121 reduce(master, assigner, partners, kdtree_partition); in kdtree()
178 detail::KDTreeSamplingPartition<Block,Point> kdtree_partition(dim, points, samples); in kdtree_sampling() local
181 reduce(master, assigner, partners, kdtree_partition); in kdtree_sampling()
|
| /dports/math/vtk8/VTK-8.2.0/ThirdParty/diy2/vtkdiy2/include/vtkdiy2/ |
| H A D | algorithms.hpp | 118 detail::KDTreePartition<Block,Point> kdtree_partition(dim, points, bins); in kdtree() local
121 reduce(master, assigner, partners, kdtree_partition); in kdtree()
178 detail::KDTreeSamplingPartition<Block,Point> kdtree_partition(dim, points, samples); in kdtree_sampling() local
181 reduce(master, assigner, partners, kdtree_partition); in kdtree_sampling()
|
| /dports/math/vtk9/VTK-9.1.0/ThirdParty/diy2/vtkdiy2/include/vtkdiy2/ |
| H A D | algorithms.hpp | 118 detail::KDTreePartition<Block,Point> kdtree_partition(dim, points, bins); in kdtree() local
121 reduce(master, assigner, partners, kdtree_partition); in kdtree()
178 detail::KDTreeSamplingPartition<Block,Point> kdtree_partition(dim, points, samples); in kdtree_sampling() local
181 reduce(master, assigner, partners, kdtree_partition); in kdtree_sampling()
|
| /dports/science/mcstas/mcstas-2.5-src/lib/share/ |
| H A D | interpolation-lib.c | 116 int kdtree_partition(vertex **points, int d, int left, int right, int pivot) in kdtree_partition() function
152 int pivotNewIndex = kdtree_partition(points,d,left,right,pivotIndex); in kdtree_splitAboutMedian()
|