Path: utzoo!attcan!uunet!aplcen!samsung!umich!umeecs!zip!spencer From: spencer@eecs.umich.edu (Spencer W. Thomas) Newsgroups: comp.graphics Subject: Re: dithering Message-ID: Date: 2 Oct 90 15:55:54 GMT References: <13919@netcom.UUCP> <7312@eos.UUCP> Sender: news@zip.eecs.umich.edu Organization: University of Michigan EECS Dept Lines: 23 In-Reply-To: jbm@eos.UUCP's message of 27 Sep 90 18:43:46 GMT > allanh@netcom.UUCP (Allan N. Hessenflow) writes: >I'm looking for any references on dithering algorithms that work for an output >device with higher addressable resolution than dot-size. jbm>In article <7312@eos.UUCP> jbm@eos.UUCP (Jeffrey Mulligan) writes: jbm> A "clustered dot" algorithm is generally indicated when you have overlapping jbm> printer dots, because it at least does a pretty good job of insuring jbm> monotonicity. Two useful references are: D. E. Knuth, "Digital halftones by dot diffusion", ACM Transactions on Graphics, Vol 6, No 4, Oct, 1987, pp 245-273. He discusses an interesting algorithm that produces clustered dot halftones. R. Ulichney, _Digital Halftoning_, MIT Press, 1987. This book is a comprehensive discussion of bitonal dithering and halftoning algorithms. -- =Spencer W. Thomas EECS Dept, U of Michigan, Ann Arbor, MI 48109 spencer@eecs.umich.edu 313-936-2616 (8-6 E[SD]T M-F)