|
|
|
| A fast direct point-by-point generating algorithm for B Spline curves and surfaces |
| LI Zhong, HAN Dan-fu |
| Department of Information and Computing Science, Zhejiang University of Sciences, Hangzhou 310033, China; Department of Mathematics, Zhejiang University, Hangzhou 310027, China; Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200030, China |
|
|
|
Abstract Traditional generating algorithms for B Spline curves and surfaces require approximation methods where how to increment the parameter to get the best approximation is problematic; or they take the pixel-based method needing matrix transformation from B Spline representation to B¨|zier form. Here, a fast, direct point-by-point generating algorithm for B Spline curves and surfaces is presented. The algorithm does not need matrix transformation, can be used for uniform or nonuniform B Spline curves and surfaces of any degree, and has high generating speed and good rendering accuracy.
|
|
Received: 02 February 2004
|
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
