Then are you using it kinda like a kd-tree (filter everything within a threshold of forwardDistance1, then angleDelta1, then next dimension and so on)? But then how do you handle the initial scaling? What about cumulative error in heading or distance?
which gives a value for how close to polylines are (it normalizes them and does some distance calculations)
the way the vp tree works is you provide a set of data and a metric for distance (in my case, the data was the polylines and the metric was from dollar) and it computes the structure. As long as the metric observes some basic principles (I think it's called triangle inequality) the spatial division will work and you can do a fast search for nearest neighbors.
How does one arrive on a data arts team? was it a passion project or was it an existing team in the org? also how would you hire for such a team? thanks.
It is possible that something is disabling your WebGL support. You can check the status of your GPU support in `chrome://gpu` and, if necessary, use the "Override software rendering list" in `chrome://flags` to force it.
and overview video: https://www.youtube.com/watch?v=w6-LK9BOVTA