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.graph2;
import java.awt.BasicStroke;
import java.awt.Color;
import java.awt.Graphics2D;
import java.awt.geom.CubicCurve2D;
import java.awt.geom.Line2D;
import java.awt.geom.Point2D;
import java.awt.geom.Rectangle2D;
import java.util.ArrayList;
import java.util.List;
public class MyCurve {
private final CubicCurve2D.Double curve;
private final List<Line2D.Double> lines = new ArrayList<Line2D.Double>();
private final List<Line2D.Double> linesForInters = new ArrayList<Line2D.Double>();
private Color color = Color.GREEN;
private double lenght = 0;
public MyCurve(CubicCurve2D.Double curve) {
this.curve = curve;
addCurve(curve);
if (lenght <= 0) {
throw new IllegalStateException();
}
for (Line2D.Double line : lines) {
linesForInters.add(change(line, curve.getP1(), curve.getP2()));
}
}
private Line2D.Double change(Line2D.Double line, Point2D p1, Point2D p2) {
if (line.getP1().equals(p1) == false && line.getP2().equals(p2) == false) {
return line;
}
final double dx = line.x2 - line.x1;
final double dy = line.y2 - line.y1;
if (line.getP1().equals(p1)) {
p1 = new Point2D.Double(line.x1 + dx / 10, line.y1 + dy / 10);
} else {
p1 = line.getP1();
}
if (line.getP2().equals(p2)) {
p2 = new Point2D.Double(line.x2 - dx / 10, line.y2 - dy / 10);
} else {
p2 = line.getP2();
}
return new Line2D.Double(p1, p2);
}
public final double getLenght() {
return lenght;
}
private void addCurve(CubicCurve2D.Double peace) {
final Rectangle2D bounds = peace.getBounds2D();
final double flat = peace.getFlatness();
if (flat < 10) {
lines.add(new Line2D.Double(peace.getP1(), peace.getP2()));
lenght += Math.sqrt(bounds.getWidth() * bounds.getWidth() + bounds.getHeight() * bounds.getHeight());
return;
}
final CubicCurve2D.Double left = new CubicCurve2D.Double();
final CubicCurve2D.Double right = new CubicCurve2D.Double();
peace.subdivide(left, right);
addCurve(left);
addCurve(right);
}
public void drawDebug(Graphics2D g2d) {
for (Line2D r : linesForInters) {
g2d.setColor(color);
g2d.draw(r);
}
g2d.setColor(Color.BLACK);
// g2d.draw(curve);
}
public void draw(Graphics2D g2d) {
g2d.setStroke(new BasicStroke((float) 1.5));
g2d.draw(curve);
g2d.setStroke(new BasicStroke());
}
public final void setColor(Color color) {
this.color = color;
}
public boolean intersects(List<MyCurve> others) {
for (MyCurve other : others) {
if (this.intersects(other)) {
return true;
}
}
return false;
}
private boolean intersects(MyCurve other) {
for (Line2D.Double l1 : this.linesForInters) {
for (Line2D.Double l2 : other.linesForInters) {
if (l1.intersectsLine(l2)) {
return true;
}
}
}
return false;
}
public boolean intersects(RectanglesCollection forbidden) {
for (Rectangle2D.Double r : forbidden) {
for (Line2D.Double line : lines) {
if (r.intersectsLine(line)) {
return true;
}
}
}
return false;
}
// public static long TPS6;
//
// public RectanglesCollection unrecoveredBy(RectanglesCollection allFrames)
// {
// final long start = System.currentTimeMillis();
// try {
// final RectanglesCollection result = new RectanglesCollection();
// for (Rectangle2D.Double r : areas) {
// if (allFrames.intersect(new RectanglesCollection(r)) == false) {
// result.add(r);
// }
// }
// return result;
// } finally {
// TPS6 += System.currentTimeMillis() - start;
// }
// }
//
}
|
