Any continuous piecewise-linear function can be represented as a linear combination of functions of at most affine-linear functions. In our previous paper [``Representing piecewise linear functions by functions with small arity'', AAECC, 2023], we showed that this upper bound of arguments is tight. In the present paper, we extend this result by establishing a correspondence between the function and the minimal number of arguments that are needed in any such decomposition. We show that the tessellation of the input space induced by the function has a direct connection to the number of arguments in the functions.
View on arXiv