Abstract: The pair of a point set and a polynomial space P on is correct if the restriction map is invertible, i.e., if there is, for any f defined on , a unique which matches f on .

We discuss here a particular assignment , introduced by us previously, for which is always correct, and provide an algorithm for the construction of a basis for , which is related to Gauss elimination applied to the Vandermonde matrix for . We also discuss some attractive properties of the above assignment and algorithmic details, and present some bivariate examples.