Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
The Mathematical Structure of Raster Graphics presents a mathematical characterization of the structure of raster graphics, a popular and diverse form of computer graphics. The semantics and theory of the mathematical structure of raster graphics are discussed. Notations that help to clarify some of the concepts generally considered to be fundamental to computer graphics are included.
Comprised of seven chapters, this book begins with a description of a general framework for specifying and manipulating scenes. Basic graphic entities, called primitive graphic objects, are defined using a simple notation over a Euclidean space. The reader is then introduced to a semantics of visibility; a mathematical semantics of rendering, developed using the very basic notion of measure; and a mathematical formalization of bit-mapped graphics. A framework for specifying illumination models is also described, along with the complexity of abstract ray tracing.
This monograph will be a useful resource for undergraduate and graduate students, researchers, and practitioners in the fields of mathematics and computer graphics, and to those with some basic computer graphics background.
The First Word
0. Motivation and Overview
0.1. Raster Graphics
0.2. The Need for Formalism in Raster Graphics
0.3. Related Work
0.4. Overview of Book and Its Contributions
0.5. Conventions and Assumptions
1. Scene Specification
1.2. Related Work
1.3. Object Representation and Mathematical Preliminaries
1.4. Primitive Graphic Objects
1.5. Combining Primitive Graphic Objects
1.6. Graphic Transformations
1.7. Scenes and Scene Semantics
2.2. Definitions and Semantics
2.3. On Lower Bounds for the Visible Surface Problem
2.4. A Lower Bound for the VSP on More Complex Scenes
2.5. Upper Bounds for the RVSP under the Output List Model
3.2. The Rendering Framework
3.3. Discrete Approximations to Continuous Intensity Measures
3.4. A Fast Rendering Approximation
4. Bit-Mapped Graphics
4.3. The Semantics of Bit-Map Operations
4.4. Rendering 2-D Scenes Into Images
4.5. Line Segments and Their Rasterisation
4.6. Image Transformations and Their Rasterisation
5. Illumination Models
5.2. Local Illumination Models
5.3. Global Illumination Models Based on Ideal Ray Tracing
5.4. An Example: Whitted's Global Illumination Model
6. The Complexity of Abstract Ray Tracing
6.3. The Results
6.4. Classes of Abstract Ray-Tracing Problems
6.5. Does Nature "Solve" Intractable Problems in "Real-Time"?
7. The Last Word
- No. of pages:
- © Academic Press 1989
- 28th April 1989
- Academic Press
- eBook ISBN: