In recent published papers we have presented the Extreme Vertices Model (EVM), a concise and complete model for representing orthogonal polyhedra. This model exploits the simplicity of its domain by allowing robust and simple algorithms for set-membership classification and Boolean operations that do not need to perform floating-point operations. A digital image is geometrically analogue to an orthogonal polyhedron and can therefore be represented with the EVM. In this paper we discuss the performance in terms of space occupancy and algorithm complexity of representing digital binary images by this model. We also present a boundary extraction algorithm of a 3D digital image using the EVM and discuss its performance.