curves

gnuplot stacked filledcurves can't show the corrects sum

那年仲夏 提交于 2019-12-01 23:47:41
问题 Currently I working on Gnulot stacked filledcurves. I have problem to make my graphs stacked. This is my data: prog reli perf avail sec cons topo scale qos 2011 138 90.3 21.0 63.5 45.5 48.5 6.8 4.0 5.5 2012 191.3 77.8 90.8 30.8 29.0 22.1 2.0 1.0 1.0 2013 85.0 57.5 48.0 20.0 27.5 8.5 0 2.5 1.0 2014 2.0 0.5 1.0 2.0 1.0 1.5 0 0 0 I have plotted on t1.plt set term pos eps font 20 set output 't1.eps' set pointsize 0.8 set border 11 set xtics out set tics front set key below set multiplot a=0 plot

gnuplot stacked filledcurves can't show the corrects sum

独自空忆成欢 提交于 2019-12-01 21:11:59
Currently I working on Gnulot stacked filledcurves. I have problem to make my graphs stacked. This is my data: prog reli perf avail sec cons topo scale qos 2011 138 90.3 21.0 63.5 45.5 48.5 6.8 4.0 5.5 2012 191.3 77.8 90.8 30.8 29.0 22.1 2.0 1.0 1.0 2013 85.0 57.5 48.0 20.0 27.5 8.5 0 2.5 1.0 2014 2.0 0.5 1.0 2.0 1.0 1.5 0 0 0 I have plotted on t1.plt set term pos eps font 20 set output 't1.eps' set pointsize 0.8 set border 11 set xtics out set tics front set key below set multiplot a=0 plot for [i=1:9] "t1" using (column(i)):xtic(1) t column(i) with filledcurves my current output: my

distance matrix of curves in python

↘锁芯ラ 提交于 2019-11-28 21:40:15
I have a set of curves defined as 2D arrays (number of points, number of coordinates). I am calculating a distance matrix for them using Hausdorff distance. My current code is as follows. Unfortunately it is too slow with 500-600 curves each having 50-100 3D points. Is there any faster way for that? def distanceBetweenCurves(C1, C2): D = scipy.spatial.distance.cdist(C1, C2, 'euclidean') #none symmetric Hausdorff distances H1 = np.max(np.min(D, axis=1)) H2 = np.max(np.min(D, axis=0)) return (H1 + H2) / 2. def distanceMatrixOfCurves(Curves): numC = len(Curves) D = np.zeros((numC, numC)) for i in

How to make a line curve through points

只谈情不闲聊 提交于 2019-11-28 12:06:41
I'm looking for a way to make a line curve through a number of points. It would be preferable to use 3 points although I've considered that in order to give context to the angle of the line entering a point more may be needed to give context to the curve so to speak. In general a start point P1, a control point P2 and an end point P3, the line should curve to P2 from P1 and then curve from P2 to P3. In fact here is a perfect example of the effect I would like to achieve: If I could do this I really would be eternally grateful! In Java so far, I have tried playing around with things such as

distance matrix of curves in python

陌路散爱 提交于 2019-11-27 14:03:27
问题 I have a set of curves defined as 2D arrays (number of points, number of coordinates). I am calculating a distance matrix for them using Hausdorff distance. My current code is as follows. Unfortunately it is too slow with 500-600 curves each having 50-100 3D points. Is there any faster way for that? def distanceBetweenCurves(C1, C2): D = scipy.spatial.distance.cdist(C1, C2, 'euclidean') #none symmetric Hausdorff distances H1 = np.max(np.min(D, axis=1)) H2 = np.max(np.min(D, axis=0)) return

How to make a line curve through points

半世苍凉 提交于 2019-11-27 06:45:15
问题 I'm looking for a way to make a line curve through a number of points. It would be preferable to use 3 points although I've considered that in order to give context to the angle of the line entering a point more may be needed to give context to the curve so to speak. In general a start point P1, a control point P2 and an end point P3, the line should curve to P2 from P1 and then curve from P2 to P3. In fact here is a perfect example of the effect I would like to achieve: If I could do this I