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
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2020, 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.hector;
import java.awt.geom.Point2D;
import net.sourceforge.plantuml.geom.LineSegmentDouble;
import net.sourceforge.plantuml.hector.UnlinearCompression.Rounding;
class UnlinarCompressedPlan {
private final UnlinearCompression compX;
private final UnlinearCompression compY;
public UnlinarCompressedPlan(double inner, double outer) {
this(inner, outer, inner, outer);
}
public UnlinarCompressedPlan(double innerx, double outerx, double innery, double outery) {
this.compX = new UnlinearCompression(innerx, outerx);
this.compY = new UnlinearCompression(innery, outery);
}
public double getInnerX() {
return compX.innerSize();
}
public double getInnerY() {
return compY.innerSize();
}
public HectorPath uncompressSegmentSimple(Point2D pp1, Point2D pp2) {
final HectorPath result = new HectorPath();
result.add(new LineSegmentDouble(uncompress(pp1, UnlinearCompression.Rounding.CENTRAL), uncompress(pp2,
UnlinearCompression.Rounding.CENTRAL)));
return result;
}
public HectorPath uncompressSegment(Point2D pp1, Point2D pp2) {
double x1 = pp1.getX();
double y1 = pp1.getY();
final double x2 = pp2.getX();
final double y2 = pp2.getY();
final HectorPath result = new HectorPath();
final double y[] = compY.encounteredSingularities(y1, y2);
if (y.length == 0 || x1 == x2) {
result.add(new LineSegmentDouble(uncompress(pp1, UnlinearCompression.Rounding.CENTRAL), uncompress(pp2,
UnlinearCompression.Rounding.CENTRAL)));
return result;
}
System.err.println("len=" + y.length);
final LineSegmentDouble segment = new LineSegmentDouble(pp1, pp2);
for (int i = 0; i < y.length; i++) {
final double x = segment.getIntersectionHorizontal(y[i]);
final Rounding r = i == 0 ? UnlinearCompression.Rounding.CENTRAL : UnlinearCompression.Rounding.BORDER_2;
result.add(uncompress(x1, y1, r), uncompress(x, y[i], UnlinearCompression.Rounding.BORDER_1));
x1 = x;
y1 = y[i];
}
result.add(uncompress(x1, y1, UnlinearCompression.Rounding.BORDER_2), uncompress(x2, y2,
UnlinearCompression.Rounding.CENTRAL));
return result;
}
public HectorPath uncompress(LineSegmentDouble segment) {
double x1 = segment.getX1();
double y1 = segment.getY1();
final double x2 = segment.getX2();
final double y2 = segment.getY2();
final HectorPath result = new HectorPath();
final double x[] = compX.encounteredSingularities(x1, x2);
if (x.length == 0) {
result.add(getUncompressedSegment(x1, y1, x2, y2, UnlinearCompression.Rounding.BORDER_2));
return result;
}
for (int i = 0; i < x.length; i++) {
final double y = segment.getIntersectionVertical(x[i]);
result.add(getUncompressedSegment(x1, y1, x[i], y, UnlinearCompression.Rounding.BORDER_2));
x1 = x[i];
y1 = y;
}
result.add(getUncompressedSegment(x1, y1, x2, y2, UnlinearCompression.Rounding.BORDER_2));
return result;
}
public Point2D uncompress(Point2D pt, UnlinearCompression.Rounding rounding) {
return uncompress(pt.getX(), pt.getY(), rounding);
}
public Point2D uncompress(double x, double y, UnlinearCompression.Rounding rounding) {
return new Point2D.Double(compX.uncompress(x, rounding), compY.uncompress(y, rounding));
}
private LineSegmentDouble getUncompressedSegment(final double x1, final double y1, final double x2,
final double y2, UnlinearCompression.Rounding rounding) {
final LineSegmentDouble un1 = new LineSegmentDouble(compX.uncompress(x1, rounding), compY.uncompress(y1,
rounding), compX.uncompress(x2, rounding), compY.uncompress(y2, rounding));
return un1;
}
// private LineSegmentDouble getUncompressedSegmentRoundBefore(final double
// x1, final double y1, final double x2,
// final double y2) {
// final LineSegmentDouble un1 = new LineSegmentDouble(compX.uncompress(x1),
// compY.uncompress(y1),
// compX.uncompress(x2) - compX.innerSize(), compY.uncompress(y2));
// return un1;
// }
}
|
