kd-tree - Wikipedia, the free encyclopedia

resource thumbnail

Remove from Bookmarks

Do you really want to remove?
This action cannot be undone. Choose 'Cancel' to stop and go back.
Cancel
Ratings: 0
  • Which text to add here??

Added by gromgull on 2011-04-19 11:16

» Viewed 538 times
» Favorited by 0 user(s)
» 0 Comments
» This resource has public visibility

Holder of Rights:

License: unknown

Creator(s):

Description:
In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-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).

Add to Collection

You don't have any collections yet. Click here to create your first collection!

Okay

Share to Group

You don't have any group you can share this resource with: the resource is already shared to all groups you are member in. Click here to see available groups!

Okay

Create QR Code

Please select the URI for the QR Code:




Create Cancel

Tags

sort: alphabetically • by frequency
use blanks to separate tags

Comments

kd-tree - Wikipedia, the free encyclopedia In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-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).