Xref: utzoo comp.sys.atari.st:36885 comp.sys.atari.st.tech:1886
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sdd.hp.com!spool.mu.edu!munnari.oz.au!brolga!uqcspe!cs.uq.oz.au!warwick
From: warwick@cs.uq.oz.au (Warwick Allison)
Newsgroups: comp.sys.atari.st,comp.sys.atari.st.tech
Subject: Re: Flicker Palettes [was Re: Graphics on the STE...]
Message-ID: <583@uqcspe.cs.uq.oz.au>
Date: 4 Apr 91 23:36:05 GMT
Article-I.D.: uqcspe.583
References: <1991Apr3.004047.511@jato.jpl.nasa.gov> <1991Apr3.055519.2322@ns.network.com> <1991Apr3.223921.16258@jato.jpl.nasa.gov> <1991Apr4.052519.9240@wam.umd.edu>
Sender: news@cs.uq.oz.au
Reply-To: warwick@cs.uq.oz.au
Followup-To: comp.sys.atari.st
Lines: 29

In <1991Apr4.052519.9240@wam.umd.edu> dmb@wam.umd.edu (David M. Baggett) writes:

>Anybody know how to algorithmically pick colors that always blend?

	Colours with a similar lumminance will blend fine.

>Maybe if we assigned everyone reading this newsgroup a color combination
>to try and compiled the results... (Heck, there are only 262,144 different
>combinations.  Aren't there supposed to be tens of thousands reading
>this group?  Well then, that's only, what, 10-20 per person?  I'll start
>the ball rolling with 000 and 001...)

Hmm, let's see, two palettes of 16 colours, each colour has 512 choices.
That's 512 to the power of 32.  Which is the measley small value of

497323236409786642155382248146820840100456150797347717440463976893159497012533375533056
different palette pairs, less equivalent pairs.

okay, I'll do 2 and 3. :-)

No, but I'll check out the technique a bit more, using the pallette described
in the fractint post.

Warwick.
--
  _--_|\   	warwick@cs.uq.oz.au
 /      *  <--	Computer Science Department,
 \_.--._/ 	University of Queensland,
       v    	AUSTRALIA.