Comments (2)
This is no small task, even just for searching. If you wanted to do it, I encourage you use thrust. It would probably make more sense to fork the project, and define all stl members (e.g. std::vector
) as thrust host vectors. You would then be able to relatively conveniently compute the KD tree on the CPU, and use simple assignments to thrust::device_vector
's to get the built tree over there.
That said, I'd be very surprised if you got any performance gains. It will almost certainly be slower. The kinds of access patterns exhibited by a KD tree are far from ideal for GPUs. I myself have attempted this a couple times over the years, and have never gotten anything useful out of it. You're better off using an octree. It's not easy to engineer, but there's an excellent chapter on octree textures you can work off of. The use of textures makes things particularly well suited for GPUs.
from nanoflann.
I had a feeling that might be the case (after some quick googling), but thought I'd ask. I'll checkout the octree ref, thanks!
from nanoflann.
Related Issues (20)
- Radius search for dynamic adaptor HOT 1
- Request for Support with Copy and Move Semantics for KDTree in nanoflann Library HOT 1
- Support KNN search within radius HOT 2
- Performance issues with RKNNResultSet HOT 2
- What't the the meaning of function accum_dist?
- the Strange code in middleSplit_()
- In debug mode, knnsearch will trigger _CONTAINER_DEBUG_LEVEL HOT 5
- What is correct implementation in order to query farthest(not closest) point?
- Version wasn't bumped since 1.5.1 HOT 1
- vcpkg
- KDTreeEigenMatrixAdaptor Build Index Issue after the Update 1.5.0 HOT 1
- How to add new distance metrics?
- When the number of point clouds is more than 400K,why does my code slow down?
- parallel query ? HOT 4
- Ordered indices returned from radius searches?
- rknnSearch input arg radius or radius squared?
- E: Unable to locate package libnanoflann-dev HOT 1
- Fastest Way to radiusSearch a Vector of Query Points
- use node index access instead of pointers
- findNeighbors does not sort results HOT 1
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from nanoflann.