Lattices on simplicial partitions

In this paper, (d+1)-pencil lattices on simplicial partitions in Rd are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition, providing a continuous piecewise polynomial interpolant over the extended lattice. The number of degrees of freedom is equal to the number of vertices of the simplicial partition. The constructive proof of this fact leads to an efficient computer algorithm for the design of a lattice.