Uploaded April 2018 | Updated September 2026, 26 minutes ago
Here is a k-d Tree implementation for Unity: gist.github.com/ditzel/194ec800053ce7083b73faa1be9101b0
The k-d tree is a data structure for a fast search in 3D space. I implemented and adopted it to the need of a unity developer. You can find the nearest object to a given position very fast.
This is especially interesting for mobile applications.
More information: en.wikipedia.org/wiki/K-d_tree
Here is a k-d Tree implementation for Unity: gist.github.com/ditzel/194ec800053ce7083b73faa1be9101b0
The k-d tree is a data structure for a fast search in 3D space. I implemented and adopted it to the need of a unity developer. You can find the nearest object to a given position very fast.
This is especially interesting for mobile applications.
More information: en.wikipedia.org/wiki/K-d_tree










