A useful and simple algorithm is presented for interactively generating B-spline interpolation curves and surfaces from B-spline approximation solutions. The difference between the data points and the B-spline approximation is used to modify the control vertices in order to generate a succession of
β¦ LIBER β¦
Efficient Algorithms for the Implementation of General B-Splines
β Scribed by L.A. Ferrari; M.J. Silbermann; P.V. Sankar
- Publisher
- Elsevier Science
- Year
- 1994
- Weight
- 209 KB
- Volume
- 56
- Category
- Article
- ISSN
- 1049-9652
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An efficient algorithm for generating B-
β
Wang, Hui Ping ;Hewgill, Denton E. ;Vickers, Geoffrey W.
π
Article
π
1990
π
Wiley (John Wiley & Sons)
π
English
β 302 KB
π 1 views
Sorting algorithms for the implementatio
β
Alberto Garcia-Diaz; Donald K. Friesen; Donald J. Bagert
π
Article
π
1984
π
John Wiley and Sons
π
English
β 258 KB
B-spline collocation algorithms for nume
β
BΓΌlent Saka; Ali Εahin; Δ°dris DaΔ
π
Article
π
2009
π
John Wiley and Sons
π
English
β 440 KB
Efficient Implementation of the NelderβM
β
SaΕ‘a Singer; Sanja Singer
π
Article
π
2004
π
John Wiley and Sons
β 137 KB
Quartic B-spline collocation algorithms
β
BΓΌlent Saka; Δ°dris DaΔ
π
Article
π
2007
π
John Wiley and Sons
π
English
β 465 KB
An efficient implementation of an algori
β
Hadjiconstantinou, E.; Christofides, N.
π
Article
π
1999
π
John Wiley and Sons
π
English
β 263 KB
π 1 views
In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho