Sciweavers

CAGD
2005

Corner cutting systems

13 years 4 months ago
Corner cutting systems
If we can evaluate a curve by means of a corner cutting algorithm, we call the corresponding system of functions a corner cutting system. We prove that corner cutting systems are always monotonicity preserving. We obtain weak sufficient conditions for corner cutting systems. Optimal stability properties and properties concerning the supports of the basis functions of corner cutting systems are also analyzed. 2004 Elsevier B.V. All rights reserved.
Jorge Delgado, Juan Manuel Peña
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2005
Where CAGD
Authors Jorge Delgado, Juan Manuel Peña
Comments (0)