Generalized scanning technique for display of parametrically defined surfaces
IEEE Computer Graphics and Applications
Surface algorithms using bounds on derivatives
Computer Aided Geometric Design
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Curves and surfaces for computer aided geometric design: a practical guide
Curves and surfaces for computer aided geometric design: a practical guide
Algorithm for algebraic curve intersection
Computer-Aided Design
Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memories
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Real-time rendering of trimmed surfaces
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Distributing display lists on a multicomputer
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
An adaptive subdivision algorithm for crack prevention in the display of parametric surfaces
Proceedings on Graphics interface '90
Interactive manipulation and display of surfaces in four dimensions
I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
Leo: a system for cost effective 3D shaded graphics
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Algorithms for intersecting parametric and algebraic curves I: simple intersections
ACM Transactions on Graphics (TOG)
Scan line methods for displaying parametrically defined surfaces
Communications of the ACM
Rendering trimmed NURBS with adaptive forward differencing
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
The Scaling Behavior of Viewing Transformations
IEEE Computer Graphics and Applications
Ray tracing parametric patches
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Hidden Surface Removal Algorithms for Curved Surfaces
Hidden Surface Removal Algorithms for Curved Surfaces
A subdivision algorithm for computer display of curved surfaces.
A subdivision algorithm for computer display of curved surfaces.
Triangulation and display of rational parametric surfaces
VIS '94 Proceedings of the conference on Visualization '94
Accelerated walkthrough of large spline models
Proceedings of the 1997 symposium on Interactive 3D graphics
View-dependent refinement of progressive meshes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Bridging the gap between CSG and Brep via a triple ray representation
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
A unified approach for simplifying polygonal and spline models
Proceedings of the conference on Visualization '98
Real-time rendering of deformable parametric free-form surfaces
Proceedings of the ACM symposium on Virtual reality software and technology
Scalable parallel algorithms for interactive visualization of curved surfaces
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Watertight tessellation using forward differencing
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Interactive Display of Large NURBS Models
IEEE Transactions on Visualization and Computer Graphics
Budget sampling of parametric surface patches
I3D '03 Proceedings of the 2003 symposium on Interactive 3D graphics
Incremental polygonization of deforming NURBS surfaces
Journal of Graphics Tools
Incremental rendering of deformable trimmed NURBS surfaces
Proceedings of the ACM symposium on Virtual reality software and technology
| Hi-index | 0.00 |
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.