Two-dimensional Search Tree
even levels of the tree are the horizontal coordinate; odd levels, vertical
A kd-tree is similar to a 1D-tree, except that the odd levels of the tree represent divisions in the vertical coordinate, and the even levels of the tree in the horizontal coordinate. Except for alternating in the treatment of the two coordinates, a 2D-tree is constructed in the same way as a 1D-tree.
This work was done by Shubhomoy Biswas, F&M '05.
Thirteen movies are available: for eight points (three movies), sixteen points (three movies, thirty-two points (four movies, including one with pauses to pose questions to the viewer), and 64 points (three movies). Remember the guidelines for use of these movies.
|
|||
|
|||
|
|||
|
