|
Test that KD-Tree is built correctly. |
Test edge cases such as an empty KD-Tree. |
|
Test the nearest neighbor search function. |
Test that KD-Tree is built correctly.
Empty points list.
Positive depth value.
Negative depth value.
Test edge cases such as an empty KD-Tree.
Test the nearest neighbor search function.