Before revision:  We use this correspondence to construct a broad family of spline bases on generic point multisets, generalizing a known result on Delaunay configurations . Our spline bases are naturally defined on finite knot sets with affine dependencies and higher multiplicities, without need for special treatment of degenerate cases. We reformulate our bases in the language of zonotopal tilings, via the Bohne-Dress theorem, obtaining a link to a known construction algorithm for bivariate spline bases based on centroid triangulations. In the second part of this work, we restrict again our attention to weighted Delaunay configurations and the associated spline bases, and we capitalize on our combinatorial viewpoint to extend, in this restricted case, the well-known bivariate construction algorithm to higher dimensions and generic point multisets.
After revision:  We use this correspondence to construct a broad family of spline bases on generic point multisets, generalizing a known result on Delaunay configurations and naturally encompasses, due to its combinatorial character, the case of repeated and affinely dependent points in A. We prove the existence of a general iterative construction process for such spaces. Finally, we turn our attention to weighted Delaunay configurations and the associated spline bases, and we capitalize on our combinatorial viewpoint to extend, in this restricted case, the well-known bivariate construction algorithm to higher dimensions and generic point multisets.