On Thursday, November 22, 2012 23:51:08 TP wrote:
Thus it seems to me that my dummy example given in the previous post covers
exactly the problem encountered in my real-world imshow function.
Is there a memory-efficient workaround in my dummy example (instead of
increasing N)?
I have
On Monday, November 26, 2012 12:06:40 Eric Firing wrote:
I'm glad you found a solution, but my sense is that the problem is that
you are trying to make the colormap do the work of the norm. The
colormap is just a set of discrete colors, with a linear mapping to the
0-1 scale (apart from the
On 2012/11/26 12:18 PM, TP wrote:
On Monday, November 26, 2012 12:06:40 Eric Firing wrote:
I'm glad you found a solution, but my sense is that the problem is that
you are trying to make the colormap do the work of the norm. The
colormap is just a set of discrete colors, with a linear mapping
On Monday, November 26, 2012 14:10:31 Eric Firing wrote:
But how many colors can you actually distinguish on the screen, or in a
plot? My impression is that the problem is not lack of colors, but
rather mapping to the color you want. There is no reason that having a
value in your *data* of
On Monday, November 19, 2012 13:53:21 Eric Firing wrote:
It is not entirely clear to me what you are trying to do, but it sounds
like increasing N is not the right way to do it. Three things might help
you find a better way:
1) The colormap is intended to work with a norm that handles the
Hi everybody,
I have a problem with LinearSegmentedColormap.
In the example below (see PS), I make a colormap, and use it to plot an
EllipseCollection. My plot is parameterized by a quantity that I have named
large_value. For large_value equal to 257, a blue point is obtained at
(x=0.3,
On 2012/11/19 11:42 AM, TP wrote:
Hi everybody,
I have a problem with LinearSegmentedColormap.
In the example below (see PS), I make a colormap, and use it to plot an
EllipseCollection. My plot is parameterized by a quantity that I have named
large_value. For large_value equal to 257, a blue
