Data Structures for Raster Graphics Proceedings of a Workshop held at Steensel, The Netherlands, June 24–28, 1985
Raster graphics differs from the more traditional vector or line graphics in the sense that images are not made up from line segments but from discrete elements orderly arranged in a two-dimensional rectangular region. There are two reasons for the growing popularity of raster graphics or bit-mapped...
Other Authors: | , , |
---|---|
Format: | eBook |
Language: | English |
Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1986, 1986
|
Edition: | 1st ed. 1986 |
Series: | Focus on Computer Graphics
|
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Problems with raster graphics algorithms
- Display algorithms for quadtrees and octtrees and their hardware realisation
- Intermediate data structures for display algorithms
- Data structures for ray tracing
- An approach for a PHIGS machine
- Using linear quadtrees to store vector data
- A model for raster graphics language primitives
- Pattern representation
- A 3D animation system
- Applications of the method of invariants in computer graphics
- Bibliography on quadtrees and related hierarchical data structures