| A linear time Oslo algorithm |
| Full text |
Pdf
(381 KB)
|
| Source
|
ACM Transactions on Graphics (TOG)
archive
Volume 10 , Issue 3 (July 1991)
table of contents
Pages: 312 - 318
Year of Publication: 1991
ISSN:0730-0301
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 15, Downloads (12 Months): 61, Citation Count: 1
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
COHEN, E., LYCHE, T., AND RmSENrELD, R. Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics. Cornput. Graph. Image Process. 14, 2 (Oct. 1980), 87-111.
|
| |
3
|
JI^, R. Total positivity of the discrete spline collocation matrix. J. Approx. Theor. 39 (1983), 11-23.
|
| |
4
|
LANE, g. M., AND CARPENTER, L. C. A generalized scan line algorithm for the computer display of parametrically defined surfaces. Comput. Graph. Image Process. 11 (1979), 290-297.
|
 |
5
|
|
| |
6
|
LANE, J. M., AND RIESENFELD, R.F. A theoretical development for the computer generation and display of piecewise polynomial surfaces. 1EEE Trans. Pattern Anal. Mach. lntell. 2, 1 (Jan. 1980), 35-46.
|
| |
7
|
|
| |
8
|
SWEENEY, M. A. J., AND BARTEUS, R. H. Ray tracing free-form B-spline surfaces. IEEE Comput. Graph. Appl. 6, 2 (Feb. 1986), 41-49.
|
|