Smooth appearance for polygonal surfaces

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Current shading methods for polygonal approximations to smooth surfaces reveal the polygon edges by lack of smoothness in the shading, highlights, texture, reflection lines, intersections, profiles, and shadows. These defects are eliminated here by interpolating the perspective depth in screen coordinates with a C1 piecewise-polynomial function, defined over triangles in the screen plane. The three eye-space components of the surface normal, and the two texture parameters, are separately interpolated with similar C1 functions. For smooth intersections, the depth comparison test of Watkins' scan-line algorithm is replaced by a simple test which uses closed-form solutions to polynomials of degree 2, 3, or 4. When the scan lines arise from scan planes containing the eye and the light source, a version of the shadow volume algorithm can also generate smooth cast shadows. © 1989 Springer-Verlag.

Cite

CITATION STYLE

APA

Max, N. (1989). Smooth appearance for polygonal surfaces. The Visual Computer, 5(3), 160–173. https://doi.org/10.1007/BF01901391

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free