In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing 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 neighbor searches). k-d trees are a special case of binary space partitioning trees.
Join or login to comment.
Thought provoking - the thought being provoked is that I'd better know this stuff :)
0 · December 10, 2012
Hi,Iam Anand, I am interested to know how the classes will be conducted.
0 · August 23, 2012
HI,My name is Andre and I'm a MD/PhD interested in learning DS/A. Where are the lectures?Thanks!Andre
0 · July 16, 2012
Next: Invite friends
Talk about algorithms. Share your experiences and talk about cool code that you wrote.
SPONSOR MESSAGE Lyft is currently offering members of our Meetup free ride credit to try the service! Just click here or visit https://www.lyft.com/invited/HACKERS to get the free credit. I love Lyft and have had great ride experiences.
Vendavo is the leader in front-line profit optimization
Mathematica is the world's ultimate application for computations.
Local online advertising for small businesses.
Free ride credit to try the service. Fast and safe way to get around.
Or sign up with email
Already a member? Log in.
Meetup members, Log in