| 1 |
/* NatCubic.java |
| 2 |
Copyright (C) 2012 Tim Lambert, Red Hat, Inc. |
| 3 |
|
| 4 |
This file is part of IcedTea. |
| 5 |
|
| 6 |
IcedTea is free software; you can redistribute it and/or modify |
| 7 |
it under the terms of the GNU General Public License as published by |
| 8 |
the Free Software Foundation; either version 2, or (at your option) |
| 9 |
any later version. |
| 10 |
|
| 11 |
IcedTea is distributed in the hope that it will be useful, but |
| 12 |
WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 14 |
General Public License for more details. |
| 15 |
|
| 16 |
You should have received a copy of the GNU General Public License |
| 17 |
along with IcedTea; see the file COPYING. If not, write to the |
| 18 |
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
| 19 |
02110-1301 USA. |
| 20 |
|
| 21 |
Linking this library statically or dynamically with other modules is |
| 22 |
making a combined work based on this library. Thus, the terms and |
| 23 |
conditions of the GNU General Public License cover the whole |
| 24 |
combination. |
| 25 |
|
| 26 |
As a special exception, the copyright holders of this library give you |
| 27 |
permission to link this library with independent modules to produce an |
| 28 |
executable, regardless of the license terms of these independent |
| 29 |
modules, and to copy and distribute the resulting executable under |
| 30 |
terms of your choice, provided that you also meet, for each linked |
| 31 |
independent module, the terms and conditions of the license of that |
| 32 |
module. An independent module is a module which is not derived from |
| 33 |
or based on this library. If you modify this library, you may extend |
| 34 |
this exception to your version of the library, but you are not |
| 35 |
obligated to do so. If you do not wish to do so, delete this |
| 36 |
exception statement from your version. */ |
| 37 |
package net.sourceforge.jnlp.splashscreen.impls.defaultsplashscreen2012; |
| 38 |
|
| 39 |
import java.awt.*; |
| 40 |
|
| 41 |
public class NatCubic extends ControlCurve { |
| 42 |
|
| 43 |
/* |
| 44 |
* This class is part of the NatCubic implementation (http://www.cse.unsw.edu.au/~lambert/) |
| 45 |
* which does not have a license. The author (Tim Lambert) has agreed to |
| 46 |
* license this under GPL+Classpath by email |
| 47 |
* |
| 48 |
*/ |
| 49 |
/* |
| 50 |
NatCubic calcualtion |
| 51 |
calculates the natural cubic spline that interpolates |
| 52 |
y[0], y[1], ... y[n] |
| 53 |
The first segment is returned as |
| 54 |
C[0].a + C[0].b*u + C[0].c*u^2 + C[0].d*u^3 0<=u <1 |
| 55 |
the other segments are in C[1], C[2], ... C[n-1] */ |
| 56 |
Cubic[] calcNaturalCubic(int n, int[] x) { |
| 57 |
float[] gamma = new float[n + 1]; |
| 58 |
float[] delta = new float[n + 1]; |
| 59 |
float[] D = new float[n + 1]; |
| 60 |
int i; |
| 61 |
/* We solve the equation |
| 62 |
[2 1 ] [D[0]] [3(x[1] - x[0]) ] |
| 63 |
|1 4 1 | |D[1]| |3(x[2] - x[0]) | |
| 64 |
| 1 4 1 | | . | = | . | |
| 65 |
| ..... | | . | | . | |
| 66 |
| 1 4 1| | . | |3(x[n] - x[n-2])| |
| 67 |
[ 1 2] [D[n]] [3(x[n] - x[n-1])] |
| 68 |
|
| 69 |
by using row operations to convert the matrix to upper triangular |
| 70 |
and then back sustitution. The D[i] are the derivatives at the knots. |
| 71 |
*/ |
| 72 |
|
| 73 |
gamma[0] = 1.0f / 2.0f; |
| 74 |
for (i = 1; i < n; i++) { |
| 75 |
gamma[i] = 1 / (4 - gamma[i - 1]); |
| 76 |
} |
| 77 |
gamma[n] = 1 / (2 - gamma[n - 1]); |
| 78 |
|
| 79 |
delta[0] = 3 * (x[1] - x[0]) * gamma[0]; |
| 80 |
for (i = 1; i < n; i++) { |
| 81 |
delta[i] = (3 * (x[i + 1] - x[i - 1]) - delta[i - 1]) * gamma[i]; |
| 82 |
} |
| 83 |
delta[n] = (3 * (x[n] - x[n - 1]) - delta[n - 1]) * gamma[n]; |
| 84 |
|
| 85 |
D[n] = delta[n]; |
| 86 |
for (i = n - 1; i >= 0; i--) { |
| 87 |
D[i] = delta[i] - gamma[i] * D[i + 1]; |
| 88 |
} |
| 89 |
|
| 90 |
/* now compute the coefficients of the cubics */ |
| 91 |
Cubic[] C = new Cubic[n]; |
| 92 |
for (i = 0; i < n; i++) { |
| 93 |
C[i] = new Cubic((float) x[i], D[i], 3 * (x[i + 1] - x[i]) - 2 * D[i] - D[i + 1], |
| 94 |
2 * (x[i] - x[i + 1]) + D[i] + D[i + 1]); |
| 95 |
} |
| 96 |
return C; |
| 97 |
} |
| 98 |
final int STEPS = 12; |
| 99 |
|
| 100 |
/* draw a cubic spline */ |
| 101 |
@Override |
| 102 |
public void paint(Graphics g) { |
| 103 |
super.paint(g); |
| 104 |
if (pts.npoints >= 2) { |
| 105 |
if (getResult() == null) { |
| 106 |
calcualteAndSaveResult(); |
| 107 |
} |
| 108 |
g.drawPolyline(result.xpoints, result.ypoints, result.npoints); |
| 109 |
} |
| 110 |
} |
| 111 |
|
| 112 |
@Override |
| 113 |
public Polygon calcualteResult() { |
| 114 |
Cubic[] X = calcNaturalCubic(pts.npoints - 1, pts.xpoints); |
| 115 |
Cubic[] Y = calcNaturalCubic(pts.npoints - 1, pts.ypoints); |
| 116 |
/* very crude technique - just break each segment up into steps lines */ |
| 117 |
Polygon p = new Polygon(); |
| 118 |
p.addPoint(Math.round(X[0].eval(0)), Math.round(Y[0].eval(0))); |
| 119 |
for (int i = 0; i < X.length; i++) { |
| 120 |
for (int j = 1; j <= STEPS; j++) { |
| 121 |
float u = j / (float) STEPS; |
| 122 |
p.addPoint(Math.round(X[i].eval(u)), Math.round(Y[i].eval(u))); |
| 123 |
} |
| 124 |
} |
| 125 |
return p; |
| 126 |
} |
| 127 |
} |