-
Ideas to reduce the cache pressure during point lookup:
where:
- Perform initially
- Perform between iterations upon some criteria being met
what:
- binning
- KD Trees
-
For triangle objects (or sufficiently complex scenes made of balls, boxes and walls) you will notice that iterating through all objects is slow. Skip objects that will not be hit by current ray (or ra…
-
- [ ] We need a DIR-type calibration stage (minimally using kd trees and nearest neighbor search).
- [ ] The associated spectroscopic catalog should be taken in as input at the selector stages.
As…
-
not really an issue, but a question/comment as id love to contribute to phistoffury... have you looked into piggybacking off spotify's annoy framework in lieu of kd trees?
https://github.com/spotif…
-
We have a case (the `cosmo8` dataset) where a spatial dataset is extremely skewed (always hashes to a single partition), making queries very difficult. If we had a MyriaL query that applied a balanced…
-
We need to leverage kD trees to help show the images proper.
@yvshri take a look into this :smile:
-
Currently, `MatchingFacetSetCounts` iterates over `FacetSetMatcher` instances passed into it linearly. While this is fine in some cases, if we have a large amount of `FacetSetMatcher`'s, this can be i…
-
The current implementation of particle distance detection uses a naive O(n^2) algorithm. This makes the library extremely slow for even a relatively small amount of particles. I suggest an implementat…
-
It is possible to [insert](https://en.wikipedia.org/wiki/K-d_tree#Adding_elements) and [delete](https://en.wikipedia.org/wiki/K-d_tree#Removing_elements) elements from kd-trees in _O(log n)_ (occasion…
-
If a `Kd_tree` is generated from a point set that triggers one of the degenerate linear cases described in https://doc.cgal.org/5.3.2/Spatial_searching/index.html#title3 (the easiest reproduction case…