NetNews Usenet Archive 1992 #31/NN_1992_31.iso/spool/comp/graphics/13135

Text File | 1992-12-22 | 1.5 KB | 37 lines

Newsgroups: comp.graphics
Path: sparky!uunet!spool.mu.edu!darwin.sura.net!zaphod.mps.ohio-state.edu!news.acns.nwu.edu!network.ucsd.edu!dcdwest!benson
From: [e-mail] (Peter Benson)
Subject: Request: Computing Equally Spaced Colors
Message-ID: <[e-mail]>
Organization: ITT Aerospace/Communications Division - West
Date: Mon, 21 Dec 92 22:25:32 GMT
Lines: 27

I would like to be able to generate a set of N equally spaced colors of
constant brightness.  By equally spaced, I mean in a perceptual sense so
that each color is maximally distinct for that set of N.

I would also like to be able to generate sets of N equally spaced colors
for the two most common classes of color-blind people, red-green and
yellow-blue.  I am assuming that  this will be a similar algorithm to the
early set but with one dimension excluded.

The goal is to specifiy the colors in RGB.  I suspect the correct way to
do this is to sample a line in CIELUV space at N points and then transform
the co-ordinates to RGB.

Is this possible?  Does the code exist to do this?  What incorrect
assumptions am I making?  Is there a book somewhere that describes this
process in explicit detail?

I don't read this group often so e-mail answers would be appreciated.

Thanks in advance.


--
Peter Benson, Ph.D.             | ITT Aerospace/Communications Division
phone: [phone]            | 10060 Carroll Canyon Road
fax:   [phone]            | San Diego, CA 92131
email: dcdwest![e-mail]  |