cudaKDTree
cudaKDTree copied to clipboard
Hi, apologies for the big text that follows! I am trying to implement a find-closest-point in 4 dimensions using this library in the following way. Initially, I create randomly a...
Thanks for your great work! It's been incredibly useful for my projects. I'm currently integrating it into a new application and need to keep track of the original order of...
hello,when i follow the example like: /* code */ struct PointPlusPayload { float3 position; int payload; }; struct PointPlusPayload_traits : public cukd::default_data_traits { using point_t = float3; static inline __device__...
Hello, I'm having the following problem: when I run ./cukd_sample and other testing code,it will have some problem: terminate called after throwing an instance of thrust: system:: system_error' what(): parallel_for...
I could manage to build and query the tree on three dimensions. But is it possible to build a tree of arbitrary dimensions?
Hi, I have seen the example for building the _kd-tree_ on host using `cukd::buildTree_host`. Is it also possible to perform scan for the nearest neighbor on host, via `cukd::stackFree::fcp` or...
for (int i = 0; i < 100000; i++) { SpatialKDTree tree; cukd::buildTree(tree, pts, pt_num, buildConfig); cudaMemGetInfo(&freeMem, &totalMem); std::cout
In my previous experience, it has been shown that if sort is called multiple times in a short period of time, the latency of the cube library is much shorter...