1 / 8

k-d tree

k-d tree. k -dimensional indexing. Definition. Let k be a positive integer. Let t be a k -d tree, with a root node p . Then, for any node n in t : The key j , j+1 , …, j-1 of any node q in the left subtree of n is smaller than that of node p ,

kelly-hill
Download Presentation

k-d tree

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. k-d tree k-dimensional indexing

  2. Definition • Let k be a positive integer. Let t be a k-d tree, with a root node p. Then, for any node n in t : • The key j,j+1, …, j-1 of any node q in the left subtree of n is smaller than that of node p, • The key j,j+1, …, j-1 of any node q in the right subtree of n is larger than that of node p. k-d trees

  3. Example 20,31 15,15 36,10 6,6 31,40 25,16 40,36 k-d trees

  4. Insertion 20,31 15,15 36,10 6,6 31,40 25,16 40,36 k-d trees

  5. Exact Search 20,31 (40, 36) 15,15 36,10 6,6 31,40 25,16 40,36 k-d trees

  6. Range search 20,31 15,15 36,10 6,6 31,40 25,16 40,36 k-d trees

  7. Deletion 20,31 15,15 36,10 28,5 38,40 45,8 32,16 40,36 Delete the blue point Copy the pink point up k-d trees

  8. Deletion 28,5 15,15 36,10 38,40 45,8 32,16 40,36 Delete the old pink point k-d trees

More Related