Triangular C^m interpolation by rational functions
Interpolation over triangles is an essential problem in computer aided geometric design. Using Bernstein-Bézier technique, the authors construct piecewise rational local \(C^m\)-interpolants of given \(C^m\)-data \((m=1, 2,\dots)\) on a triangulation \(T\). Local interpolant means that the interpolant restricted on any triangle of \(T\) depends only on the data defined on that triangle. For \(m=1\) and \(m=2\), the constructions are similar to that of \textit{G. Herron} [SIAM J. Numer. Anal. 22, 811-819 (1985; Zbl 0593.65008)] and of \textit{X. Liu} and \textit{Y. Zhu} [Comput. Aided Geom. Des. 12, No. 4, 329-348 (1995; Zbl 0875.68841)]. The interpolation error is estimated. Some numerical examples are given.
- Tetrahedral C^m interpolation by rational functions
- scientific article; zbMATH DE number 5161714 (Why is no real title available?)
- scientific article; zbMATH DE number 3945231 (Why is no real title available?)
- A Characterization of Certain C^1 Discrete Triangular Interpolants
- scientific article; zbMATH DE number 779153 (Why is no real title available?)
- A representation of a C^ 2 interpolant over triangles
- \(C^{1}\) modeling with A-patches from rational trivariate functions
- A characterization of certain \(C^{2}\) discrete triangular interpolants
This page was built for publication: Triangular \(C^m\) interpolation by rational functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724925)