A novel scan-line algorithm for displaying bicubic surfaces is presented. 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 intersections. A bound of the algorithm's error is given. The method is compared with Whitted's algorithm.
CitationPueyo, X.; Brunet, P. A parametric-space-based scan-line algorithm for rendering of bicubic surfaces. "IEEE computer graphics and applications", 1987, vol. 7, núm. 11, p. 17-25.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com