开发者

What is the R*-Tree algorithm? [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently a开发者_Go百科ccepting answers.

We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.

Closed 3 years ago.

Improve this question

Where can I find enough documentation to implement an R*-Tree? Specifically, I need to be able to:

  • Insert nodes
  • Remove nodes
  • Search for K nearest neighbours
  • Find all nearest neighbours within distance x.

Is there a single place where this algorithm is clearly documented? Or is there a clean, open source implementation I can study? Even better, if you can point me to a javascript implementation then my work is already done.

0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜