Efficient storage compression for 3D regions

Summary form only given. We present the results of the comparison of heuristics algorithms for efficient storage compression for 3D regions. We have implemented five different algorithms. We present the experimental results of the comparison of these five algorithms; the first one is a simple, space consuming, approach that works as the upper bound for the storage requirements of the other four algorithms. It actually groups cubes into larger parallelepipeds. The second algorithm is an invariant of the algorithm of Franzblau-Kleitman (1984). We produced an invariant of their algorithm for 3D regions. Our contribution is the development of the other three algorithms that have less storage requirements than the algorithm of Franzblau-Kleitman. The algorithms have been tested in practice. We used them on files containing 3D regions. Every file contained cubes, described with triples of coordinates. We calculated the number of rectangles that every algorithm generates. A small number of rectangles indicates good performance