Set intervals techniques are an efficient way of dealing with uncertainty in spatial localization problems. In these techniques, the desired set (e.g., set of possible locations) is represented by an expression that uses intersection, union, and complement of input sets – which are usually only known with interval uncertainty. To find the desired set, we can, in principle, perform the corresponding set-interval computations one-by-one. However, the estimates obtained by such straightforward computations often contain extra elements – e.g., fake boundaries. It was known that we can eliminate these fake boundaries (and other extra elements) if we first transform the original set expression into an appropriate DNF/CNF form. In this paper, we prove a new result, that any DNF/CNF form enables us to eliminate the extra elements – thus, we can use the shortest possible DNF/CNF form and therefore, speed up the corresponding computations.