Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!dg!dg-rtp.dg.com!mpogue
From: mpogue@dg-rtp.dg.com (Mike Pogue)
Newsgroups: comp.graphics
Subject: Re: bit masks
Message-ID: <887@dg.dg.com>
Date: 30 Aug 90 22:07:19 GMT
References: <23900013@sunb4>
Sender: root@dg.dg.com
Reply-To: mpogue@dg.dg.com
Organization: Data General, Westboro, MA.
Lines: 14

In article <23900013@sunb4>, mcooper@sunb4.cs.uiuc.edu writes:
|> 
|> I'm looking for an algorithm (or C code, of you have it) to generate
|> 16 x 16 bit masks.  Ideally, I should be able to specify a percentage and
|> the program should spit out the pattern filled appropriately.
|> 

   The algorithm you want (called ordered dither) is described in both
the Graphics Gems book, and the new edition of Foley and VanDam.

Mike Pogue
Data General Corp.

Speaking for myself alone....