Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!hellgate.utah.edu!cs.utexas.edu!uunet!seismo!esosun!cogen!celerity!celit!billd
From: billd@fps.com (Bill Davidson)
Newsgroups: comp.graphics
Subject: Re: How to map 24-bit RGB to 256 co
Message-ID: <600@celit.com>
Date: 3 Sep 89 10:14:35 GMT
References: <7772@cbmvax.UUCP> <1109@krafla.rhi.hi.is>
Sender: daemon@fps.com
Reply-To: billd@fps.com (Bill Davidson)
Organization: FPS Computing Inc., San Diego CA
Lines: 18

In article <1109@krafla.rhi.hi.is> pierre@rhi.hi.is (Kjartan Pierre Emilsson) writes:
>A year ago or so, there was a similar discussion and there a method originally
>devised by Paul Heckbert was introduced, called Color Cube Compression. 
>I don't have the original posting but the method went something like that:

[a description of Heckbert's MEDIAN CUT algorithm deleted]
>	and allocating them specially.  The reast of the picture can then be
>	treated with the CCC algorithm.
>									 
>P.S: I hope I got this method right.

Well it would be right if you called it median cut.  It also was a
reasonable answer to the question.  The CCC algorithm that I know
about is the "Color Cell Compression" algorithm which is a data
compression algorithm for color images, not a color quantization
algorithm.  It was published in the SIGGRAPH '86 proceedings.

--Bill Davidson