Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles $Revision: 1.6.2.14 $; site umn-cs.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!ihnp4!stolaf!umn-cs!bolte
From: bolte@umn-cs.UUCP
Newsgroups: net.graphics
Subject: Allocation of color map
Message-ID: <12800001@umn-cs.UUCP>
Date: Sun, 26-May-85 17:52:00 EDT
Article-I.D.: umn-cs.12800001
Posted: Sun May 26 17:52:00 1985
Date-Received: Thu, 30-May-85 02:03:52 EDT
Lines: 20
Nf-ID: #N:umn-cs:12800001:000:527
Nf-From: umn-cs!bolte    May 26 16:52:00 1985



Greetings:

	I am doing some ray tracing as an independent study project and 
have run up against a brick wall. The problem is allocating the color
lookup map (8 bits deep) properly to match whatever distribution of colors
result from any single run. I would appreciate either algorithms other people
have worked out or a reference to a paper on the topic.


  Thanks in advance,

  Scott Bolte
  U. of Minnesota
  AI Lab
  CSNET:bolte.umn-cs@csnet-relay
  USNET:ihnp4!umn-cs!bolte

  Motto of the month: SIGGRAPH or Broke!