Google
 

Computer Graphics

Computes First Book of Atari Graphics

#  Image Acquisition

* 2D Image Input

o 2D Input Devices
o Frame Stores

* 3D imaging

o The 3D Image -- Depth Maps
o Why use 3D data?
o Introduction to Stereo Imaging -- Theory
o Methods of Acquisition
o Our Active Stereo Vision System

# Image processing

* Fourier Methods

o What do frequencies mean in an image?
o Fourier Theory
o Convolution
o Fourier Transforms and Convolutions
o The Fast Fourier Transform Algorithm

Computer Vision and Image Processing (David Marshall)

Perhaps no single technology has had more impact on people than television. Yet according to the experts the real impact is just starting.

The reason? Home computers that connect to a standard television and convert it into a machine with more raw power than any product ever offered to the consumer and with the capability to completely alter the way we relate to the visual world of electronics.

Computer Graphics Primer

Computer owners, who view stunning graphic effects or play visually exciting games, rarely consider the effort or techniques required to achieve those images. They don't realize that a programmer's ability to create Atari graphics can be compared to an artist's ability using a sketchpad or an animator's skill using animation techniques. In fact, an arcade game is basically an interactive cartoon in which the player controls a character or object that influences the action of the remaining computer-controlled objects on the screen.

Blender 3D Tutorials

This book is a series of tutorials arranged in a sequence to help the new user become a Blender expert. The tutorials become increasingly more difficult; as a result intermediate users may quickly advance to whatever tutorial is most suitable for their knowledge and can continue along the sequence. Although there are many different learning paths a user could take, we've made a concerted effort to accommodate everyone.

Architecture for Combinator Graph Reduction

The results of cache-simulation experiments with an abstract machine for
reducing combinator graphs are presented. The abstract machine, called TIGRE,
exhibits reduction rates that, for similar kinds of combinator graphs on
similar kinds of hardware, compare favorably with previously reported
techniques. Furthermore, TIGRE maps easily and efficiently onto standard
computer architectures, particularly those that allow a restricted form of
self-modifying code. This provides some indication that the conventional
"stored program" organization of computer systems is not necessarily

Syndicate content