Descartes systems from corner cutting

DOI10.1007/BF01888152zbMath0784.65017MaRDI QIDQ1174712

Charles A. Micchelli, Allan Pinkus

Publication date: 25 June 1992

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01888152

zbMATH Keywords

totally positive matrices; corner cutting; Descartes systems; matrix subdivision algorithms

Mathematics Subject Classification ID

41A63: Multidimensional problems

65D99: Numerical approximation and computational geometry (primarily algorithms)

Related Items

Refinable Functions: Positivity and Interpolation, Newman cyclotomic polynomials, refinable splines and the Euler binary partition function, Accurate Computations and Applications of Some Classes of Matrices, Subdivision schemes and refinement equations with nonnegative masks, Positivity of refinable functions defined by nonnegative finite masks, Regularity of refinable function vectors, Corner cutting curves and a new characterization of Bézier and B-spline curves, Shape preserving representations and optimality of the Bernstein basis, LU decomposition of totally nonnegative matrices, On refinable functions and subdivision with positive masks, The Euler binary partition function and subdivision schemes

Cites Work

• Unnamed Item
• Corner cutting algorithms for the Bézier representation of free form curves
• De Casteljau-type subdivision is peculiar to Bézier curves
• Uniform refinement of curves
• The approximation of a totally positive band matrix by a strictly banded totally positive one
• Some properties of totally positive matrices
• Ein Kriterium für den Nachweis der Totalnichtnegativität von Bandmatrizen