ACM Home Page
Please provide us with feedback. Feedback
Rendering trimmed NURBS with adaptive forward differencing
Full text PdfPdf (2.45 MB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 15th annual conference on Computer graphics and interactive techniques table of contents
Pages: 189 - 198  
Year of Publication: 1988
ISBN:0-89791-275-6
Also published in ...
Authors
Micheal Shantz  Sun Microsystems, Inc., 2500 Garcia Avenue, Mountain View, CA
Sheue-Ling Chang  Sun Microsystems, Inc., 2500 Garcia Avenue, Mountain View, CA
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 64,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/54852.378510
What is a DOI?

ABSTRACT

Trimmed non-uniform rational B-splines have become a very useful surface representation form in the mechanical CAD industry. Previous rendering methods use the de Boor algorithm to evaluate the surface at equal increments in parameter space. This yields polygons which are then rendered. Alternatively the Oslo algorithm and Boehm's knot insertion algorithms are used in a subdivision approach. In this paper a new method is presented for rendering trimmed NURB surfaces of arbitrary order using the adaptive forward differencing (AFD) technique. This method extends the AFD technique to higher order, efficiently computes the basis matrix for each span, calculates the shading approximation functions for rational surfaces, and trims and image maps NURB surfaces. Trimming is accomplished by using AFD to scan convert the trimming curves in parameter space, thus producing the intersection points between the trim curves and an isoparametric curve across the surface. A winding rule is used to determine the regions bounded by the curve which are then rendered with AFD. The method is suitable for both hardware and software implementations, however, higher order surfaces require very high precision due to the forward difference nature of the algorithm.


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
Wolfgang Boehm, Inserting New Knots into B-Spline Curves, 12, pp. 199-201, Computer Aided Design, 1980.
 
3
Wolfgang Boehm, Efficient Evaluation of Splines, 33 , pp. 171-177, Computing, 1984.
 
4
Carl de Boor, On calculating with B-splines, 6, pp. 50- 62, Journal of Approximation Theory, 1972.
 
5
Edwin Catmull, A Subdivision Algorithm for Computer Display of Curved Surfaces, UTEC-CSe-74-133, University of Utah, Computer Science, 1974.
 
6
Elaine Cohen, Tom Lyche, and Richard Riesenfeld, Discrete B-Splines and Subdivision Techniques in Computer-Aided Geometric Design and Computer Graphics, 14, Computer Graphics and Image Processing, October 1980.
 
7
Robert Cook, Patch Work, Tech. Memo 118, Computer Div., Lucasfilm Ltd., June 1985.
8
 
9
 
10
E.T.Y. Lee, Efficient Evaluation of Splines, 329, pp. 365-371, Computing, 1982.
11
 
12
 
13
Hartmut Prautzsch, A Short Proof of the Oslo Algorithm, 1, Computer Aided Geometric Design, 1984.
 
14
15

CITED BY  15

Collaborative Colleagues:
Micheal Shantz: colleagues
Sheue-Ling Chang: colleagues