1. Three-pencil lattice on triangulationsGašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2007, published scientific conference contribution Abstract: In this paper, three-pencil lattices on triangulations are studied. The explicit representation of a lattice, based upon barycentric coordinates, enables us to construct lattice points in a simple and numerically stable way. Further, this representation carries over to triangulations in a natural way. The construction is based upon group action of S 3 on triangle vertices, and it is shown that the number of degrees of freedom is equal to the number of vertices of the triangulation.
Keywords: numerical analysis, lattice, barycentric coordinates, triangulations, interpolation
Published in RUP: 03.04.2017; Views: 2127; Downloads: 84
 Link to full text |
2. Barycentric coordinates for Lagrange interpolation over lattices on a simplexGašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2008, published scientific conference contribution Abstract: In this paper, a ▫$(d+1)$▫-pencil lattice on a simplex in ▫${\mathbb{R}}^d$▫ is studied. The lattice points are explicitly given in barycentric coordinates. This enables the construction and the efficient evaluation of the Lagrange interpolating polynomial over a lattice on a simplex. Also, the barycentric representation, based on shape parameters, turns out to be appropriate for the lattice extension from a simplex to a simplicial partition.
Keywords: numerical analysis, lattice, barycentric coordinates, simplex, interpolation
Published in RUP: 03.04.2017; Views: 2244; Downloads: 139
Link to full text |
3. Lattices on simplicial partitionsGašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2010, published scientific conference contribution Abstract: In this paper, a ▫$(d+1)$▫-pencil lattices on a simplex in ▫${\mathbb{R}}^d$▫ 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 thisfact leads to an efficient computer algorithm for the design of a lattice.
Keywords: numerical analysis, lattice, barycentric coordinates, simplicial partition
Published in RUP: 03.04.2017; Views: 2165; Downloads: 135
Link to full text |
4. Parametric curves with Pythagorean binormalsJernej Kozak, Marjetka Knez, Vito Vitrih, 2015, original scientific article Abstract: In this paper, a class of rational spatial curves that have a rational binormal is introduced . Such curves (called PB curves) play an important role in the derivation of rational rotation-minimizing osculating frames. The PB curve construction proposed is based upon the dual curve representation and the Euler-Rodrigues frame obtained from quaternion polynomials. The construction significantly simplifies if the curve is a polynomial one. Further, polynomial PB curves of the degree % 7 and rational PB curves of the degree % 6 that possess rational rotation-minimizing osculating frames are derived, and it is shown that no lower degree curves, constructed from quadratic quaternion polynomials, with such a property exist.
Keywords: pitagorejski hodograf, pitagorejska binormala, racionalna krivulja, dualne koordinate, rotacijsko minimizirajoče ogrodje, pitagorejska binormala, racionalna krivulja, dualne koordinate, rotacijsko minimizirajoče ogrodje, Pythagorean-hodograph, Pythagorean-binormal, rational curve, dual coordinates, rotation-minimizing frame, osculating frame
Published in RUP: 15.10.2015; Views: 2667; Downloads: 124
Link to full text |
