Result: Two blossoming proofs of the Lane-Riesenfeld algorithm
Title:
Two blossoming proofs of the Lane-Riesenfeld algorithm
Authors:
Source:
Special issue on geometric modeling (Dagstuhl 2005)Computing (Wien. Print). 79(2-4):153-162
Publisher Information:
Wien: Springer, 2007.
Publication Year:
2007
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Approximations et développements, Approximations and expansions, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Approximation numérique, Numerical approximation, Méthodes de calcul scientifique (y compris calcul symbolique, calcul algébrique), Methods of scientific computing (including symbolic computation, algebraic computation), Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme, Algorithm, Algoritmo, Analyse numérique, Numerical analysis, Análisis numérico, Approximation numérique, Numerical approximation, Aproximación numérica, Approximation spline, Spline approximation, Aproximación esplín, B spline, B splín, Calcul scientifique, Scientific computation, Computación científica, Convolution, Convolución, 41A15, 65D07, 65D17.; Blossoming, B-splines, Lane-Riesenfeld algorithm, knot insertion
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science Rice University, Houston, TX 77005, United States
ISSN:
0010-485X
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.18791826
Database:
PASCAL Archive
Further Information
The standard proof of the Lane-Riesenfeld algorithm for inserting knots into uniform B-spline curves is based on the continuous convolution formula for the uniform B-spline basis functions. Here we provide two new, elementary, blossoming proofs of the Lane-Riesenfeld algorithm for uniform B-spline curves of arbitrary degree.