19.2.3 Properties of exhaustive enumeration methods Properties of exhaustive enumeration methods include Expressive power: these methods are an approximation scheme and do not form a primary representation, especially within CAD/CAM applications Unambiguity and uniqueness for fixed space(size, location and orientation of primary cube)and resolution. There do not exist different representations for the same object under these conditions(which is not true of many other representation methods such as B-rep or CSG described before) Memory intensive: eg. for a linear resolution of 256, 256 integer elements for Ciik in equation 19.1 leading to 16M bits and this is a bare minimum. Closure of operations(eg. Booleans) Computational ease for algorithms: VLSI implementation for volume rendering is possi- ble. However, for high resolution the algorithm slows down Closure means that an operation such as Boolean results in an object that can be represented by the same type of data structure19.2.3 Properties of exhaustive enumeration methods Properties of exhaustive enumeration methods include: • Expressive power: these methods are an approximation scheme and do not form a primary representation, especially within CAD/CAM applications. • Unambiguity and uniqueness for fixed space (size, location and orientation of primary cube) and resolution. There do not exist different representations for the same object under these conditions (which is not true of many other representation methods such as B-rep or CSG described before). • Memory intensive: eg. for a linear resolution of 256, 2563 integer elements for Cijk in equation 19.1 leading to 16M bits and this is a bare minimum. • Closure 1 of operations (eg. Booleans). • Computational ease for algorithms: VLSI implementation for volume rendering is possi￾ble. However, for high resolution the algorithm slows down. 1Closure means that an operation such as Boolean results in an object that can be represented by the same type of data structure. 5