Full Text:
<3219>
CLC number: TP391
On-line Access:
Received: 2004-02-02
Revision Accepted: 2004-07-01
Crosschecked: 0000-00-00
Cited: 0
Clicked: 6509
A fast direct point-by-point generating algorithm for B Spline curves and surfaces
| |||||||||||||
LI Zhong, HAN Dan-fu. A fast direct point-by-point generating algorithm for B Spline curves and surfaces[J]. Journal of Zhejiang University Science A, 2005, 6(6): 502-506.
@article{title="A fast direct point-by-point generating algorithm for B Spline curves and surfaces",
author="LI Zhong, HAN Dan-fu",
journal="Journal of Zhejiang University Science A",
volume="6",
number="6",
pages="502-506",
year="2005",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2005.A0502"
}
%0 Journal Article
%T A fast direct point-by-point generating algorithm for B Spline curves and surfaces
%A LI Zhong
%A HAN Dan-fu
%J Journal of Zhejiang University SCIENCE A
%V 6
%N 6
%P 502-506
%@ 1673-565X
%D 2005
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2005.A0502
TY - JOUR
T1 - A fast direct point-by-point generating algorithm for B Spline curves and surfaces
A1 - LI Zhong
A1 - HAN Dan-fu
J0 - Journal of Zhejiang University Science A
VL - 6
IS - 6
SP - 502
EP - 506
%@ 1673-565X
Y1 - 2005
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2005.A0502
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.
[1] Ammeraal, L., 1987. Computer Graphics for IBM PC. John Wiley & Sons, New York.
[2] Anantakrishnan, N., Piegl, L., 1992. Integer de casteljau algorithm for rasterizing NURBS curves. Computer Graphics Forum, 11(2):151-162.
[3] Bresenham, J., 1977. A linear algorithm for incremental digital display of circular arcs. Communications of ACM, 20(2):100-106.
[4] Donald, E., 1986. METAFONT the Program. Addison-Wesley, Reading, Massachusetts.
[5] Foley, J., Dam, A., Feiner, S., Hughes, J., 1990. Computer Graphics: Principles and Practice. Addison-Wesley, Reading, Massachusetts.
[6] Foley, J., Dam, A., Feiner, S., Hughes, J., 1993. Introduction to: Computer Graphics. Addison-Wesley, Reading, Massachusetts.
[7] Huang, Y., Zhu, G., 2001. A fast point-by-point generating algorithm for rational parametric curve. Chinese Journal of Computer, 24(8):809-814 (in Chinese).
[8] Klassen, R., 1991. Integer forward differencing of cubic polynomials: Analysis and algorithms. ACM Transactions on Graphics, 10(2):152-181.
[9] Pitteway, M., 1985. Algorithms of Conic Generation. Fundamental Algorithms for Computer Graphics, NATO ASI Series, p.219-237.
[10] Rappoport, A., 1991. Rendering curves and surfaces with hybrid subdivision and forward differencing. ACM Transactions on Graphcis, 10(4):323-341.
Open peer comments: Debate/Discuss/Question/Opinion
<1>
scorneo@scorneo<scorneo@gmail.com>
2010-11-03 18:17:01
thanks
Lusang@Shenyang university<lusang@sina.com>
2010-06-19 17:01:12
study it