Fundamentals of Computer Graphics Algorithms

Author: Roger J. Schortz
Publisher:
Publish Date: 2002-01-01
Features: This book can be largely considered a rewrite. It holds special value for students, programmers, and computer graphics professionals. The newly added sections primarily include graphical user interfaces, ellipses, image compression, and anti-aliasing line algorithms. In addition to the classic Cohen-Sutherland clipping algorithm, the midpoint subdivision method, the Cyrus-Beck clipping algorithm, and the Sutherland-Hodgman clipping algorithm, the book now also includes the Liang-Barsky clipping algorithm and the Nicholl-Lee-Nicholl clipping algorithm. The chapter on visibility algorithms has been expanded with classic algorithms such as Appel, stippling, A-buffer, binary space partitioning (BSP), octrees, and marching cubes. The original visibility ray tracing algorithm has also been significantly expanded. The drawing chapter now covers physical-based lighting models, transparency, shadows, and textures, as well as cone ray tracing, bundle ray tracing, pencil beam ray tracing, and stochastic ray tracing. This edition also provides a detailed introduction to the fundamentals of radiometry and includes topics such as uniform color spaces, gamma correction, color quantization of images, and color reproduction on printing media. However, it retains many of the meticulously crafted examples from the previous version and provides corresponding supplements.