Procedural Elements for Computer Graphics
This text offers complete coverage of computer graphics. As a textbook, it can be used effectively in senior-level computer graphics courses or in first year graduate-level courses. It features an emphasis on rendering and in-depth coverage of all classical computer graphics algorithms. Procedural Elements of Computer Graphics also contains more than 90 worked examples, and is suitable for use by professional programmers, engineers, and scientists.
Introduction To Computer Graphics
Raster Scan Graphics
5 other sections not shown
Other editions - View all
active edge list algorithm see Sec angle antialiasing boundary bounding box Bresenham's algorithm calculation clip polygon clipping algorithm clipping region components computer graphics considered convex coordinate cube curve Cyrus-Beck depth determine diffuse display dot product end if end end point codes example eyepoint Figure form factors frame buffer function Gouraud shading hemicube Hence illumination model image space implemented inside intensity Liang-Barsky light source line algorithm mapping matrix mipmapping node normal object octree parametric patch pixel plane equation polygon edge polygon list projection quantization radiosity raster ray tracing rectangle refraction rotation run-length encoding scan line scene shadow volume shown in Fig simple span specular reflection sphere stack subdivision subject polygon subpixel surface normal technique texture space three-dimensional totally visible transformation transparency triangle two-dimensional vector vertex vertices visible surface algorithm voxel Warnock algorithm window edge yields z-axis z-buffer