Efficient Storage Compression for 3D Regions

In this work we present heuristics algorithms for efficient storage compression for 3D regions. Giving a 3D decomposed in parallelepipeds, we want to store it using the least storage information. We present the steps and the experimental results of 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. In brief we present the steps of the algorithm of Franzblau-Kleitman (Franzblau and Kleitman 1984). This algorithm has a very good average performance. The algorithm works well for 2D regions. 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. Using experimental testing procedures (the results are presented in the conclusion) we present the evaluation of these algorithms. From this evaluation the fifth algorithm gives the best performance in every case. This algorithm behaves better for every case compared with the algorithm of (Franzblau and Kleitman 1984) with a near to optimal performance. 1