Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1.chuqui 4/7/84; site apple.UUCP
Path: utzoo!watmath!clyde!bonnie!akgua!whuxlm!harpo!decvax!decwrl!sun!idi!apple!leo
From: leo@apple.UUCP (Leo Hourvitz)
Newsgroups: net.graphics
Subject: Re: Allocation of color map
Message-ID: <72224@apple.UUCP>
Date: Sun, 9-Jun-85 21:10:29 EDT
Article-I.D.: apple.72224
Posted: Sun Jun  9 21:10:29 1985
Date-Received: Tue, 11-Jun-85 07:53:11 EDT
References: <12800001@umn-cs.UUCP> <218@rti-sel.UUCP> <1974@watcgl.UUCP>
Reply-To: leo@apple.csnet (Leo Hourvitz)
Organization: Apple Education Research Group, Cupertino CA
Lines: 15
Keywords: Meidan Cut, Popularity, Color Map Allocation
Summary:  Reference and discussion

The problem of finding an optimal color map for a given
image was discussed by Paul Heckbert: "Color Image
Quantization for Framebuffer Display," Siggraph '82,
page 297.  He discusses two algorithms he had
used, plus variations/extensions, etc. 

The basic methods he examines are popularity alogrithm
(pick the most popular colors) and median cut algorithm
(read the paper).  I have C code for popularity alogrithm,
write if interested.

Enjoy,

Leovitch
leo%apple.csnet (Leo Hourvitz)