Hi, I've been working on superimposing intensity graphs and I'm almost getting it, I'm just having trouble with color table, it is suppose to be composed of a 1-D array of 256 colors
I have 2 intensity graphs each with a different color table (256 color - 256 locations in the color table array). I need to "squeeze" both color table into a third color table for the superimposing of the 2 intensity graphs. therefore I figure I would take every other color value from each of the first 2 color tables (so each color table shrinks to 128 color) and add the values to form a 3rd color table so that the bottom will correspond to the first color table and the top will correspond to the 2nd color table.
I can do this manually, but it takes WAY too long, so I've been trying to use some kinda of algorism, but I cannot succeed. Anyone have any suggestions? it seems that color table is an unusual kinda of array
My attempted program is attached.
thanks very much!!