Search code examples
dimensiontree-traversalr-tree

Which c++ R-tree library can deal with the arbitrarily high-dimensional points easily?

I am doing the research on R-tree, recently I use the R-tree of boost, but I found it is hard to fill a high dimension points ( dimension > 3).

Is there any other c++ R-tree library can create the points easily at will?

I found the same problem in the past Defining a dimensional point in Boost.Geometry

I want a r-tree library which initialises high-dimension points in r-tree easily, because I am doing the research on R-tree and I want to do the traversal for R-tree.

Solution

  • I would not suggest Boost for high dimensions and I explain in my pseudo-site why.

    I would suggest you to use FLANN, which may use RKD-trees or k-means and can perform Approximate Nearest Neihgbour Search.

    Check this answer for more.