Search code examples
c++treenearest-neighborquadtree

efficient C++ template implementation for 2D range queries

I need to store custom point objects (getX() and getY() are provided) in an efficient way to perform range queries. So i was looking for templated implementations of quadtree, kd-tree or similar. For example like this: https://code.google.com/p/kche-tree/ (but this only seems to work with primitive types...?)

Are there suggestions? Or would i need to implement it myself? (open source license required)

Thanks!

Solution

  • Try to use boost. Boost are usually pretty good C++ libraries.

    And Boost Geometry has and R-tree for nearest neighbor search.