Spatial point location in convex subdivsion using binary space partition tree. Laboratory work for my computational geometry and computer graphics course.
Project requires c++11, CMake and CGAL.
cmake && make
- CGAL's polyhedron convex decomposition might have intersecting regions, which are not accepted by this algorithm. The folder data/ contains successfully tested .off files, which can be used as input. These files were taken from CGAL examples and Holmes3D files set.