Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!mcvax!enea!luthcad!sow
From: sow@luthcad.UUCP
Newsgroups: net.graphics
Subject: Re: Color Mapping Algorithms
Message-ID: <529@luthcad.UUCP>
Date: Tue, 29-Jul-86 21:27:32 EDT
Article-I.D.: luthcad.529
Posted: Tue Jul 29 21:27:32 1986
Date-Received: Thu, 31-Jul-86 23:50:18 EDT
References: <5405@sun.uucp>
Reply-To: sow@luthcad.UUCP (Sven-Ove Westberg)
Distribution: net
Organization: University of Lulea, Sweden
Lines: 24

In article <5405@sun.uucp> cmcmanis@sun.UUCP writes:
>I am looking for pointers to algorithms (thats '(algorithm *)' for you
>C programmers) that can map n bit color images where n is the same 
>for each of the red, green, and blue components, to an n bit image
>where 2^n specifies the number of colors available, each of which
>is definable by an m bit color vector (r,g,b). In plain english
>how to map an RGB image into an image producable by a palette ram
>based display. Thanks,
>

	R.J. Stevens, A.F. Lehar, F.H. Preston.
	Manipulation and Presentation of Multidimensional
	Image Data Using the Peano Scan.
	IEEE, PAMI-5,  sept. 1983, pg 520.

	E.A. Patrick, D.R. Anderson, F.K. Bechtel.
	Mapping multidimensional space to one dimension
	for computer output display.
	IEEE, Trans. Comput. pp. 949-953, Oct 1968.


Sven-Ove Westberg 
Computer Aided Analysis and Design  (CAAD)
UUCP:  {decvax,philabs,seismo}!mcvax!enea!luthcad!sow