English 中文(简体)
2. 双重树木建设
原标题:dual kd-tree construction
  • 时间:2011-04-19 05:40:33
  •  标签:
  • java
  • kdtree

请任何人告诉我,如何建造双条<条码>kd-tree,以及怎样加以改动?

至少要告诉我,在<代码>java上使用这一双重树木概念的查询计算法。 这将有助于我的项目。

谢谢。

问题回答

If you can read Python, look at the clear source for query_ball_tree described in scipy.spatial.KDTree,
"Find all pairs of points whose distance is at most r". (Is that what you want to do ?)





相关问题
Spring Properties File

Hi have this j2ee web application developed using spring framework. I have a problem with rendering mnessages in nihongo characters from the properties file. I tried converting the file to ascii using ...

Logging a global ID in multiple components

I have a system which contains multiple applications connected together using JMS and Spring Integration. Messages get sent along a chain of applications. [App A] -> [App B] -> [App C] We set a ...

Java Library Size

If I m given two Java Libraries in Jar format, 1 having no bells and whistles, and the other having lots of them that will mostly go unused.... my question is: How will the larger, mostly unused ...

How to get the Array Class for a given Class in Java?

I have a Class variable that holds a certain type and I need to get a variable that holds the corresponding array class. The best I could come up with is this: Class arrayOfFooClass = java.lang....

SQLite , Derby vs file system

I m working on a Java desktop application that reads and writes from/to different files. I think a better solution would be to replace the file system by a SQLite database. How hard is it to migrate ...

热门标签