Path: utzoo!mnetor!uunet!seismo!sundc!pitstop!sun!decwrl!decvax!ucbvax!pasteur!ames!mailrus!caen!weymouth
From: weymouth@caen.engin.umich.edu (Terry Weymouth)
Newsgroups: comp.graphics
Subject: source for graphics algorithms
Message-ID: <660@light.engin.umich.edu>
Date: 27 Feb 88 14:10:38 GMT
Organization: caen
Lines: 22
Keywords: algorithms graphics


several people asking for information on algorithms (the article ref'ed
above is an example) will find readable and detailed explinations in

Procedural Elements for Computer Graphics by David R. Rogers
McGraw-Hill 1985 ISBN 0-07-053534-5

which I highly recommend. Included are details of algorithms for:

hidden surface removal for functional surfaces
dithering (e.i. gray scale to half-tone or fixed binary array)
filling (including the problem of deciding if a point is interior to
         a polygon)
clipping (in 2D and 3D)
dividing a concave object into a set of convex objects
and 3D hidden surface removal

A very good introduction with enough details so that you can implement the
solutions you need.

-- 
Terry E. Weymouth