-
Hello,
I am trying to create some KDTrees for 117-dimensional data, yet the success of building the tree seems to be a bit random, e.g I can create a tree with 200000 points, but when I move on to cr…
yhalk updated
9 years ago
-
**Originally by _RolfRabenseifner_ on 2008-12-13 07:26:16 -0600**
---
## Description
If an application wants to create a set of disjoint subcommunicators
of a general intracommunicator and each sub…
-
Hi,
I think that the newest version can't do higher dimensional trees. The _knn function in this version takes 7 arguments, but is called with 8 (e.g., line 371). For example. this fails:
julia> tre…
-
Implement octree (loose?) for space partitioning.
-
```
There should be subMultiMap, tailMultiMap, and headMultiMap methods.
```
Original issue reported on code.google.com by `sclark...@gmail.com` on 22 Nov 2011 at 11:10
-
Please forgive my limited understanding of `cKDTree`--I will articulate the issue as clearly as I can.
I've been having a problem using `cKDTree.sparse_distance_matrix` on large arrays of points. Whe…
-
```
There should be subMultiMap, tailMultiMap, and headMultiMap methods.
```
Original issue reported on code.google.com by `sclark...@gmail.com` on 22 Nov 2011 at 11:10
-
```
There should be subMultiMap, tailMultiMap, and headMultiMap methods.
```
Original issue reported on code.google.com by `sclark...@gmail.com` on 22 Nov 2011 at 11:10
-
I've been looking through the renderer code, and wondering about perofmance overhead of using a plethora of individual meshes. Looking at the code, there are 2 major improvements to be had:
- culling
…
Usnul updated
9 years ago
-
```
There should be subMultiMap, tailMultiMap, and headMultiMap methods.
```
Original issue reported on code.google.com by `sclark...@gmail.com` on 22 Nov 2011 at 11:10