ACM Home Page
Please provide us with feedback. Feedback
Interactive display of large-scale NURBS models
Full text PdfPdf (3.19 MB)
Source Symposium on Interactive 3D Graphics archive
Proceedings of the 1995 symposium on Interactive 3D graphics table of contents
Monterey, California, United States
Pages: 51 - ff.  
Year of Publication: 1995
ISBN:0-89791-736-7
Authors
Subodh Kumar  Department of Computer Science, University of North Carolina, Chapel Hill, NC
Dinesh Manocha  Department of Computer Science, University of North Carolina, Chapel Hill, NC
Anselmo Lastra  Department of Computer Science, University of North Carolina, Chapel Hill, NC
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): 32,   Citation Count: 11
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/199404.199413
What is a DOI?

ABSTRACT

We present serial and parallel algorithms for interactive rendering of large scale and complex NURBS models on current graphics systems. The algorithms tessellate the NURBS surfaces into triangles and render them using triangle rendering engines. The main characteristics of the algorithms are improved polygonization algorithms, exploitation of spatial and temporal coherence and back-patch culling. Polygonization anomalies like cracks and angularities are avoided. We analyze a number of issues in parallelization of these techniques, as well. The algorithms work well in practice and are able to display models consisting of thousands of surfaces at interactive frame rates on the highly parallel graphics system, Pixel-Planes 5.


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
S.S. Abi-Ezzi and L.A. Shirman. Tessellation of curved surfaces under highly varying transformations. Proceedings of Eurographics '91 1 pages 385-97, 1991.
 
2
3
 
4
5
 
6
 
7
J. H. Cla:rk. A fast algorithm for rendering parametric surfaces. Proceedings of ACM Siggmph, pages 289-99, 1979.
8
9
 
10
T. Derose et. al. Apex: two architectures for generating pars metric curves and surfaces. The Visual Computer, 5:264--276, 1989.
 
11
 
12
 
13
14
15
 
16
 
17
S. Kumar and D. Manocha. Efficient rendering of trimmed nurbs surfaces. Computer-rlided Design, 1994. to appear.
18
 
19
J.M. Lane and R.F. Riesenfeld. Bounds on polynomials. .BIT, 2:112-117,198j.
 
20
W.L. Luken and Fuhua Cheng. Rendering trimmed nurb surfaces. Computer science research report 18669(81711), IBM Research Division, 1993.
21
 
22
R. Nzh. Silicon Graphics, Personal Communication, 1993.
 
23
24
 
25
26
27

CITED BY  11

Collaborative Colleagues:
Subodh Kumar: colleagues
Dinesh Manocha: colleagues
Anselmo Lastra: colleagues