Stability of interpolation from C1 cubics at the vertices of an underlying triangulation

Joerg Peters; Meera Sitharam

doi:10.1137/0729033

SIAM Journal on Numerical Analysis

Paper

01 Jan 1992

Stability of interpolation from C¹ cubics at the vertices of an underlying triangulation

View publication

Abstract

Interpolation from C1 cubics at the vertices of a triangulation is in general not stable and C1 cubics over a triangulation cannot, in general, match prescribed Bernstein-Bezier center coefficients.

Conference paper

On a partial ordering relation derived from redundancy of Slepian-Wolf coding

Da-Ke He, Ashish Jagmohan, et al.

ISIT 2007

Paper

Irredundancy in circular arc graphs

Martin Charles Golumbic, Renu C. Laskar

Discrete Applied Mathematics

Paper

On Seeing Spaghetti: Self-Adjusting Piecewise Toroidal Recognition of Flexible Extruded Objects

John R. Kender, Rick Kjeldsen

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

Bounds on the ergodic capacity of training-based multiple-antenna systems

Simeon Furrer, Dirk Dahlhaus

ISIT 2005

View all publications

Abstract

Related

On a partial ordering relation derived from redundancy of Slepian-Wolf coding

Irredundancy in circular arc graphs

On Seeing Spaghetti: Self-Adjusting Piecewise Toroidal Recognition of Flexible Extruded Objects

Bounds on the ergodic capacity of training-based multiple-antenna systems