A balanced k-d tree which can partition three-dimensional space to organize/insert objects. The input object can be a point, rectangle and hexahedron. In fact, all the objects are treated as a hexahedron with dix dimensions. Insertion of 0D+ objects such as rectangle and hexahedron is managed by changing the cutting axis in cyclic order. The k-d tree in balanced by inserting the median object in each cutting dimension. This kind of k-d tree is also called Alternating Digital Tree.
The k-d tree stores IDs of the inserted objects. When a query point (can be 0D+ such as hexahedron) is given in search operation, the tree returns possibly multiple IDs of objects which overlap the query point. The user can perform actual geometric tests from thereon.
VTK can be used to visualize the space and objects. Related files are in the vtk folder. Note that if the objects to be inserted are points, give option 0 to ./draw 0 to draw points otherwise give any other number such as ./draw 1.
A graph can be produced with dot utility.
You can find four tests in the test folder.
cd test
cmake .
make
rm *.dat
./2dpoint
Display the graph with
dot -Tpng graph.dot > graph.png
display graph.png
Visualize interactively using VTK with
cd ../vtk
cmake .
make
./draw 0
Here are the images of the graph and the partitioned space. Partitions are shown with red color.
Search operation is tested with a given target which is a rectangle. The target covers all the objects in the tree. Therefore, all the objects are returned by the search operation. The target and the overlapped object are shown in blue and green, respectively.
