  The image of a polynomial map is a constructible set. While computing its
closure is standard in computer algebra systems, a procedure for computing the
constructible set itself is not. We provide a new algorithm, based on
algebro-geometric techniques, addressing this problem. We also apply these
methods to answer a question of W. Hackbusch on the non-closedness of
site-independent cyclic matrix product states for infinitely many parameters.
