Joris De Ridder wrote:
As far as I understand, the algorithm works as follows:
1) Define what you mean by dense points
a) init what you mean by far_away
b) start at the first point, and loop over the points until you find one
far_away
c) hop to that one, continue looping
On Wednesday 06 September 2006 07:49, [EMAIL PROTECTED] wrote:
Hi,
The following plot
from numarray import *
x = arange(8)
from pylab import plot,show
plot(x,x)
show()
and saving in postscript format generated a file of 1.5MB, while the
equivalent is only 288KB in xmgrace
Darren == Darren Dale [EMAIL PROTECTED] writes:
Darren which is 17 bytes long. 17*8 = 1.36MB. Maybe we dont
Darren need as many sig figs, that could cut the size down by
Darren maybe 25%.
We could make the fmt string for PS and SVG output floats a
configurable parameter and be
On Wed, 6 Sep 2006, John apparently wrote:
could make it an rc param for those who want to trade
accuracy for space.
Does anyone really care about 25% enough to make this
worthwhile? Just wondering.
Cheers,
Alan Isaac
Alan G Isaac wrote:
Does anyone really care about 25% enough to make this
worthwhile? Just wondering.
I tend to think not. You put 80,000 points in a PS, it's going to be
big. That's all there is to it, it's the nature of Postscript.
I do think clipping is a good idea though.
What is the
