Cart (Loading....) | Create Account
Close category search window

A Parametric-Space-Based Scan-Line Algorithm for Rendering Bicubic Surfaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pueyo, X. ; Universitat Politecnica de Catalunya ; Brunet, P.

This article presents a new scan-line algorithm for displaying bicubic surfaces. Patches are decomposed on regions of constant sign of the z component of the normal before the scan process. Most of the computations are done in parametric space. The algorithm computes the intersection of the surfaces with only a restricted subset of scan planes and obtains the intersection with other scan planes by linear interpolation between exact instersections. A bound of the algorithm's error is given. Finally, the new method is compared with Whitted's algorithm.

Published in:

Computer Graphics and Applications, IEEE  (Volume:7 ,  Issue: 11 )

Date of Publication:

Nov. 1987

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.