PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Lattices on simplicial partitions
Gašper Jaklic, Jernej Kozak, Marjetka Krajnc, Vito Vitrih and Emil Žagar
J. comput. appl. math. pp. 1704-1715, 2010. ISSN 0377-0427

Abstract

In this paper, (d+1)-pencil lattices on simplicial partitions in View the MathML source 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.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8207
Deposited By:Boris Horvat
Deposited On:21 February 2012