-
### Motivation
The KDtree queries should allow to return the indices of the points instead of the coords.
Do you think this implementation could be easily updated for this feature or the structure i…
-
Currently yt makes use of the Monaghan style "scatter" method to do SPH smoothing. Others (particularly users of Gadget) may prefer the "gather" method. It would be nice to make it so the core SPH smo…
-
Thank you very much for sharing such great work.
While attempting to run your code, I encountered a few minor issues and would like to inquire about the Python version, PyTorch version you used, and…
-
When running `hdbscan` with `prims_kdtree`, I get the following traceback. Please note my matrix is sparse.
```
Traceback (most recent call last):
File "Clustering - West Coast - Teachers.py", li…
-
This implementation isn't intended for production, but it'd be nice if it were quicker to test.
- [x] Point match score lookups
Would almost certainly benefit from [pandas.cut](https://pandas.py…
-
手順通りシミュレーションを実行しようとすると、
２回に１回くらいの頻度でplanningが終わらずシミュレーションが開始しません。
https://drive.google.com/file/d/1RZkiEFu5L8dlcTmRLI_SW_Uq2nVdEoP8/view?usp=sharing
```bash
$ source install/setup.bash
$ ros2…
-
Hi,@qiqihaer ,Thanks for your reproducing the work in PyTorch.
Because I want to get the prediction of all point in each frame,but I found that Randla-Net and KPConv both do not support that form of…
-
In file included from ../nabo/kdtree_cpu.cpp:42:
In file included from /usr/local/include/boost/format.hpp:38:
In file included from /usr/local/include/boost/format/internals.hpp:20:
In file included …
-
- [ ] Store tree as a KD tree
-
Right now, the implementation of KDTree uses quite a bit of memory. In addition, all memory is allocated on the heap, which could result in slower lookups. The implementation should be changed to re…