1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2017, Arnaud Roques
*
* Project Info: http://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* http://plantuml.com/patreon (only 1$ per month!)
* http://plantuml.com/paypal
*
* This file is part of PlantUML.
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* PlantUML distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
* License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
* USA.
*
*
* Original Author: Arnaud Roques
*
*
*/
package net.sourceforge.plantuml.ugraphic;
import java.awt.Color;
public class ShadowManager {
// http://www.w3schools.com/svg/svg_feoffset.asp
private final int c1;
private final int c2;
public ShadowManager(int c1, int c2) {
this.c1 = c1;
this.c2 = c2;
}
public double[] getShadowDeltaPoints(double deltaShadow, double diff, double[] points) {
double cx = 0;
double cy = 0;
for (int i = 0; i < points.length; i += 2) {
cx += points[i];
cy += points[i + 1];
}
final int nbPoints = points.length / 2;
cx = cx / nbPoints;
cy = cy / nbPoints;
final double[] result = new double[points.length];
for (int i = 0; i < result.length; i += 2) {
final double diffx = points[i] > cx ? -diff : diff;
final double diffy = points[i + 1] > cy ? -diff : diff;
result[i] = points[i] + diffx + deltaShadow;
result[i + 1] = points[i + 1] + diffy + deltaShadow;
}
return result;
}
public Color getColor(double delta, double total) {
final int c = (int) (c2 + 1.0 * delta / total * (c1 - c2));
return new Color(c, c, c);
}
}
|
