We present a new decomposition model for Orthogonal Pseudo-Polyhedra (OPP): the Compact Union of Disjoint Boxes. This model is an improved version of the Ordered Union of Disjoint Boxes model. Our model has many desirable features versus the OUDB, such as less storage size and a better efficiency in the connected-component labeling (CCL) process. CCL is a very important operation for manipulating volume data where multiple disconnected components that compose a volume need to be identify. We present the algorithms for conversion to and from the Extreme Vertices Model, which is closely related to the OUDB, and for CCL. The performance of the CUDB is experimentally analyzed with 2D and 3D datasets.Postprint (published version
