Before revision:  We present a polynomial time algorithm to compute the bottleneck distance for these modules from indecomposables, which bounds the interleaving distance from above, and give another algorithm to compute a new distance called {\em dimension distance} that bounds it from below  .
After revision:  We present a polynomial time algorithm to compute the bottleneck distance for these modules from indecomposables, which bounds the interleaving distance from above, and give another algorithm to compute a new distance called {\em dimension distance} that bounds it from below . An earlier version of this paper considered only the 2-parameter interval decomposable modules~\mbox{%DIFAUXCMD DeyCheng18 .