Kdtree
A fast and efficient way to find the nearest neighbours using Kd-Tree Data structure in Unity3D.
Install / Use
/learn @orifmilod/KdtreeREADME
<h1>K-D TREE Algorithm with Unity-3D</h1>
In this project, I have used K-D tree data structure to search and find nearest object in the list of Asteroids for Asteroids object and draw a red line between them.
<h3>What is k-d tree? </h3> <p>In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organising points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbour searches). k-d trees are a special case of binary space partitioning trees.</p> <h5>To read more about k-d tree, <a href="https://en.wikipedia.org/wiki/K-d_tree" target="_blank"> CLICK HERE </a> </h5><img width="740" alt="a" src="https://user-images.githubusercontent.com/25881325/56099141-73950080-5f09-11e9-9bff-232bbc67d0ad.png">
