| 1 |
/* NatCubicClosed.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 |
public class NatCubicClosed extends NatCubic { |
| 40 |
|
| 41 |
/* |
| 42 |
* This class is part of the NatCubic implementation (http://www.cse.unsw.edu.au/~lambert/) |
| 43 |
* which does not have a license. The author (Tim Lambert) has agreed to |
| 44 |
* license this under GPL+Classpath by email |
| 45 |
* |
| 46 |
*/ |
| 47 |
/* |
| 48 |
NatCubic calcualtion |
| 49 |
calculates the closed natural cubic spline that interpolates |
| 50 |
x[0], x[1], ... x[n] |
| 51 |
The first segment is returned as |
| 52 |
C[0].a + C[0].b*u + C[0].c*u^2 + C[0].d*u^3 0<=u <1 |
| 53 |
the other segments are in C[1], C[2], ... C[n] */ |
| 54 |
@Override |
| 55 |
Cubic[] calcNaturalCubic(int n, int[] x) { |
| 56 |
float[] w = new float[n + 1]; |
| 57 |
float[] v = new float[n + 1]; |
| 58 |
float[] y = new float[n + 1]; |
| 59 |
float[] D = new float[n + 1]; |
| 60 |
float z, F, G, H; |
| 61 |
int k; |
| 62 |
/* We solve the equation |
| 63 |
[4 1 1] [D[0]] [3(x[1] - x[n]) ] |
| 64 |
|1 4 1 | |D[1]| |3(x[2] - x[0]) | |
| 65 |
| 1 4 1 | | . | = | . | |
| 66 |
| ..... | | . | | . | |
| 67 |
| 1 4 1| | . | |3(x[n] - x[n-2])| |
| 68 |
[1 1 4] [D[n]] [3(x[0] - x[n-1])] |
| 69 |
|
| 70 |
by decomposing the matrix into upper triangular and lower matrices |
| 71 |
and then back sustitution. See Spath "Spline Algorithms for Curves |
| 72 |
and Surfaces" pp 19--21. The D[i] are the derivatives at the knots. |
| 73 |
*/ |
| 74 |
w[1] = v[1] = z = 1.0f / 4.0f; |
| 75 |
y[0] = z * 3 * (x[1] - x[n]); |
| 76 |
H = 4; |
| 77 |
F = 3 * (x[0] - x[n - 1]); |
| 78 |
G = 1; |
| 79 |
for (k = 1; k < n; k++) { |
| 80 |
v[k + 1] = z = 1 / (4 - v[k]); |
| 81 |
w[k + 1] = -z * w[k]; |
| 82 |
y[k] = z * (3 * (x[k + 1] - x[k - 1]) - y[k - 1]); |
| 83 |
H = H - G * w[k]; |
| 84 |
F = F - G * y[k - 1]; |
| 85 |
G = -v[k] * G; |
| 86 |
} |
| 87 |
H = H - (G + 1) * (v[n] + w[n]); |
| 88 |
y[n] = F - (G + 1) * y[n - 1]; |
| 89 |
|
| 90 |
D[n] = y[n] / H; |
| 91 |
D[n - 1] = y[n - 1] - (v[n] + w[n]) * D[n]; /* This equation is WRONG! in my copy of Spath */ |
| 92 |
for (k = n - 2; k >= 0; k--) { |
| 93 |
D[k] = y[k] - v[k + 1] * D[k + 1] - w[k + 1] * D[n]; |
| 94 |
} |
| 95 |
|
| 96 |
|
| 97 |
/* now compute the coefficients of the cubics */ |
| 98 |
Cubic[] C = new Cubic[n + 1]; |
| 99 |
for (k = 0; k < n; k++) { |
| 100 |
C[k] = new Cubic((float) x[k], D[k], 3 * (x[k + 1] - x[k]) - 2 * D[k] - D[k + 1], |
| 101 |
2 * (x[k] - x[k + 1]) + D[k] + D[k + 1]); |
| 102 |
} |
| 103 |
C[n] = new Cubic((float) x[n], D[n], 3 * (x[0] - x[n]) - 2 * D[n] - D[0], |
| 104 |
2 * (x[n] - x[0]) + D[n] + D[0]); |
| 105 |
return C; |
| 106 |
} |
| 107 |
} |