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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/* ========================================================================
* 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.geom.kinetic;
import java.awt.geom.Point2D;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
public class World implements MoveObserver {
private final List<Path> paths = new ArrayList<Path>();
private final Map<Point2DCharge, Path> pathOfPoints = new HashMap<Point2DCharge, Path>();
private final List<Frame> frames = new ArrayList<Frame>();
public void addFrame(Frame frame) {
this.frames.add(frame);
}
public void addPath(Path path) {
this.paths.add(path);
}
public VectorForce getElectricForce(Point2DCharge point) {
VectorForce result = new VectorForce(0, 0);
final Quadrant quadrant = new Quadrant(point);
for (Quadrant q : quadrant.neighbourhood()) {
for (Point2DCharge pc2 : quadrantMapper.getAllPoints(q)) {
final Path path = pathOfPoints.get(pc2);
if (path.containsPoint2DCharge(point)) {
continue;
}
result = result.plus(getElectricForce(point, pc2));
}
}
return result;
}
private VectorForce getElectricForceSlow(Point2DCharge point) {
VectorForce result = new VectorForce(0, 0);
for (Path path : paths) {
if (path.containsPoint2DCharge(point)) {
continue;
}
for (Point2DCharge pc2 : path.getPoints()) {
result = result.plus(getElectricForce(point, pc2));
}
}
return result;
}
static private VectorForce getElectricForce(Point2DCharge onThis, Point2DCharge byThis) {
final double dist = onThis.distance(byThis);
if (dist == 0) {
return new VectorForce(0, 0);
}
final VectorForce result = new VectorForce(byThis.getX() - onThis.getX(), byThis.getY() - onThis.getY());
final double v = 100.0 * onThis.getCharge() * byThis.getCharge() / dist / dist;
return result.normaliseTo(v);
}
static private VectorForce getAtomicForce(Point2DCharge onThis, Point2DCharge byThis) {
final double dist = onThis.distance(byThis);
if (dist == 0) {
return new VectorForce(0, 0);
}
final VectorForce result = new VectorForce(byThis.getX() - onThis.getX(), byThis.getY() - onThis.getY());
double v = 1000 / dist / dist / dist;
if (v > 5) {
v = 5;
}
return result.normaliseTo(v);
}
Map<Point2DCharge, VectorForce> getForces() {
final Map<Point2DCharge, VectorForce> result = new LinkedHashMap<Point2DCharge, VectorForce>();
for (Path path : paths) {
for (Point2DCharge pt : path.getPoints()) {
// final VectorForce elastic = new VectorForce(0, 0);
// final VectorForce elect = new VectorForce(0, 0);
final VectorForce elastic = path.getElasticForce(pt);
final VectorForce elect = getElectricForce(pt);
VectorForce force = elastic.plus(elect);
for (Frame f : frames) {
final Point2D inter = f.getFrontierPointViewBy(pt);
if (inter != null) {
final Point2DCharge pchar = new Point2DCharge(inter, 1);
force = force.plus(getAtomicForce(pt, pchar));
}
}
result.put(pt, force);
}
}
return result;
}
public double onePass() {
double result = 0;
final Map<Point2DCharge, VectorForce> forces = getForces();
for (Map.Entry<Point2DCharge, VectorForce> ent : forces.entrySet()) {
final VectorForce force = ent.getValue();
result += force.getLength();
ent.getKey().apply(force);
}
return result;
}
public final Collection<Path> getPaths() {
return Collections.unmodifiableCollection(paths);
}
private QuadrantMapper quadrantMapper;
public void renderContinue() {
quadrantMapper = new QuadrantMapper();
pathOfPoints.clear();
for (Path path : paths) {
path.renderContinue();
}
for (Path path : paths) {
for (Point2DCharge pt : path.getPoints()) {
pt.setMoveObserver(this);
quadrantMapper.addPoint(pt);
pathOfPoints.put(pt, path);
}
}
}
public void pointMoved(Point2DCharge point) {
quadrantMapper.updatePoint(point);
}
}
|
