Department of Image Processing

In this seminar we will demonstrate various algorithms to decompose voxelized 3D objects into rectangular blocks. In contrast to 2D version of this task, 3D decomposition is more complicated and optimal solution can't be always reached in polynomial time. However, we will demonstrate several heuristic approaches and also analogies between 2D and 3D decomposition. Algorithms will be visualized step-by-step in an interactive tool. Also some results of processing database of voxelized objects will be presented.