Title: A new method for rasterization of parametric curves and its application to fast bezier patch shading
Authors: Chirikov, Sergey V.
Paltashev, Timour T.
Balabko, Pavel A.
Citation: Journal of WSCG. 1997, vol. 5, no. 1-3.
Issue Date: 1997
Publisher: Václav Skala - UNION Agency
Document type: článek
URI: http://wscg.zcu.cz/wscg1997/wscg97.htm
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Keywords: křivka inkrementálního výkresu;Bresenhamův algoritmus;Béziérovy křivky;B-drážka;rastrová grafika;kuželový interpolator
Keywords in different language: curve incremental drawing;Bresenham's algorithm;Bézier curves;B-spline;raster graphics;conic interpolator
Abstract in different language: This paper presents a unified rasterization method to render parametric curves and patches. The algorithms are extremely simple and fast. No multiplication and division are required. The proposed method combines strong sides of parametric and nonparametric representation of curves and patches. A class of curves named as L-curves is described in here. There is a simple correspondence between their parametric and nonparametric forms. It gives a possibility to divide patch rendering process into two tasks: presentation of a patch in L-form and rasterization of obtained L-curves. L-curves can represent both conic arc and Bezier curves and it is possible to use them for rasterization of B-splines and conic splines. Also L-curves can be used for interactive graphical design directly (font construction, for example). Hardware-oriented L-curve generation algorithms may be used for nonlinear color interpolation for Bezier patch shading. Final quality of this shading technique is comparable with the Phong shading method.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 5, number 1-3 (1997)

Files in This Item:
File Description SizeFormat 
CURVE6.pdfPlný text187,82 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/15933

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.