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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
|
/*************************************************************************
** BoundingBox.cpp **
** **
** This file is part of dvisvgm -- a fast DVI to SVG converter **
** Copyright (C) 2005-2019 Martin Gieseking <martin.gieseking@uos.de> **
** **
** This program 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. **
** **
** This program is 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 program; if not, see <http://www.gnu.org/licenses/>. **
*************************************************************************/
#include <algorithm>
#include <sstream>
#include "BoundingBox.hpp"
#include "Matrix.hpp"
#include "utility.hpp"
#include "XMLNode.hpp"
#include "XMLString.hpp"
using namespace std;
BoundingBox::BoundingBox ()
: _ulx(0), _uly(0), _lrx(0), _lry(0), _valid(false), _locked(false)
{
}
BoundingBox::BoundingBox (double ulxx, double ulyy, double lrxx, double lryy)
: _ulx(min(ulxx,lrxx)), _uly(min(ulyy,lryy)),
_lrx(max(ulxx,lrxx)), _lry(max(ulyy,lryy)),
_valid(true), _locked(false)
{
}
BoundingBox::BoundingBox (const DPair &p1, const DPair &p2)
: _ulx(min(p1.x(), p2.x())), _uly(min(p1.y(), p2.y())),
_lrx(max(p1.x(), p2.x())), _lry(max(p1.y(), p2.y())),
_valid(true), _locked(false)
{
}
BoundingBox::BoundingBox (const Length &ulxx, const Length &ulyy, const Length &lrxx, const Length &lryy)
: _ulx(min(ulxx.bp(),lrxx.bp())), _uly(min(ulyy.bp(),lryy.bp())),
_lrx(max(ulxx.bp(),lrxx.bp())), _lry(max(ulyy.bp(),lryy.bp())),
_valid(true), _locked(false)
{
}
BoundingBox::BoundingBox (const string &boxstr)
: _ulx(0), _uly(0), _lrx(0), _lry(0), _valid(false), _locked(false)
{
set(boxstr);
}
/** Extracts a sequence of length values from a string like "5cm, 2.4in, 0pt".
* @param[in] boxstr whitespace and/or comma separated string of lengths.
* @param[out] the extracted lengths */
vector<Length> BoundingBox::extractLengths (string boxstr) {
vector<Length> lengths;
boxstr = util::replace(boxstr, ",", " ");
boxstr = util::normalize_space(boxstr);
vector<string> lengthStrings = util::split(boxstr, " ");
for (const string &lenstr : lengthStrings) {
if (!lenstr.empty())
lengths.emplace_back(Length(lenstr));
}
return lengths;
}
/** Sets or modifies the bounding box. If 'boxstr' consists of 4 length values,
* they denote the absolute position of two diagonal corners of the box. In case
* of a single length value l the current box is enlarged by adding (-l,-l) the upper
* left and (l,l) to the lower right corner.
* @param[in] boxstr whitespace and/or comma separated string of lengths. */
void BoundingBox::set (const string &boxstr) {
vector<Length> coord = extractLengths(boxstr);
set(coord);
}
void BoundingBox::set (const std::vector<Length> &coord) {
switch (coord.size()) {
case 1:
_ulx -= coord[0].bp();
_uly -= coord[0].bp();
_lrx += coord[0].bp();
_lry += coord[0].bp();
break;
case 2:
_ulx -= coord[0].bp();
_uly -= coord[1].bp();
_lrx += coord[0].bp();
_lry += coord[1].bp();
break;
case 4:
_ulx = min(coord[0].bp(), coord[2].bp());
_uly = min(coord[1].bp(), coord[3].bp());
_lrx = max(coord[0].bp(), coord[2].bp());
_lry = max(coord[1].bp(), coord[3].bp());
break;
default:
throw BoundingBoxException("1, 2 or 4 length parameters expected");
}
_valid = true;
}
/** Enlarges the box so that point (x,y) is enclosed. */
void BoundingBox::embed (double x, double y) {
if (!_locked) {
if (_valid) {
if (x < _ulx)
_ulx = x;
else if (x > _lrx)
_lrx = x;
if (y < _uly)
_uly = y;
else if (y > _lry)
_lry = y;
}
else {
_ulx = _lrx = x;
_uly = _lry = y;
_valid = true;
}
}
}
/** Enlarges the box so that the given bounding box is enclosed. */
void BoundingBox::embed (const BoundingBox &bbox) {
if (!_locked && bbox._valid) {
if (_valid) {
embed(bbox._ulx, bbox._uly);
embed(bbox._lrx, bbox._lry);
}
else {
_ulx = bbox._ulx;
_uly = bbox._uly;
_lrx = bbox._lrx;
_lry = bbox._lry;
_valid = true;
}
}
}
/** Embeds a virtual circle into the box and enlarges it accordingly.
* @param[in] c center of the circle
* @param[in] r radius of the circle */
void BoundingBox::embed (const DPair &c, double r) {
embed(BoundingBox(c.x()-r, c.y()-r, c.x()+r, c.y()+r));
}
/** Expands the box in all four directions by a given value. */
void BoundingBox::expand (double m) {
if (!_locked) {
_ulx -= m;
_uly -= m;
_lrx += m;
_lry += m;
}
}
/** Intersects the current box with bbox and applies the result to *this.
* If both boxes are disjoint, *this is not altered.
* @param[in] bbox box to intersect with
* @return false if *this is locked or both boxes are disjoint */
bool BoundingBox::intersect (const BoundingBox &bbox) {
// check if the two boxes are disjoint
if (_locked || _lrx < bbox._ulx || _lry < bbox._uly || _ulx > bbox._lrx || _uly > bbox._lry)
return false;
// not disjoint: compute the intersection
_ulx = max(_ulx, bbox._ulx);
_uly = max(_uly, bbox._uly);
_lrx = min(_lrx, bbox._lrx);
_lry = min(_lry, bbox._lry);
return true;
}
void BoundingBox::operator += (const BoundingBox &bbox) {
if (!_locked) {
_ulx += bbox._ulx;
_uly += bbox._uly;
_lrx += bbox._lrx;
_lry += bbox._lry;
}
}
static inline bool almost_equal (double v1, double v2) {
return fabs(v1-v2) < 1e-10;
}
bool BoundingBox::operator == (const BoundingBox &bbox) const {
return _valid && bbox._valid
&& almost_equal(_ulx, bbox._ulx)
&& almost_equal(_uly, bbox._uly)
&& almost_equal(_lrx, bbox._lrx)
&& almost_equal(_lry, bbox._lry);
}
void BoundingBox::scale (double sx, double sy) {
if (!_locked) {
_ulx *= sx;
_lrx *= sx;
if (sx < 0) swap(_ulx, _lrx);
_uly *= sy;
_lry *= sy;
if (sy < 0) swap(_uly, _lry);
}
}
void BoundingBox::transform (const Matrix &tm) {
if (!_locked) {
DPair ul = tm * DPair(_ulx, _uly);
DPair lr = tm * DPair(_lrx, _lry);
DPair ll = tm * DPair(_ulx, _lry);
DPair ur = tm * DPair(_lrx, _uly);
_ulx = min(min(ul.x(), lr.x()), min(ur.x(), ll.x()));
_uly = min(min(ul.y(), lr.y()), min(ur.y(), ll.y()));
_lrx = max(max(ul.x(), lr.x()), max(ur.x(), ll.x()));
_lry = max(max(ul.y(), lr.y()), max(ur.y(), ll.y()));
}
}
string BoundingBox::toSVGViewBox () const {
ostringstream oss;
oss << XMLString(_ulx) << ' ' << XMLString(_uly) << ' ' << XMLString(width()) << ' ' << XMLString(height());
return oss.str();
}
ostream& BoundingBox::write (ostream &os) const {
os << '(' << _ulx << ", " << _uly << ", " << _lrx << ", " << _lry << ')';
if (!_valid)
os << " (invalid)";
else if (_locked)
os << " (locked)";
return os;
}
unique_ptr<XMLElement> BoundingBox::createSVGRect () const {
auto rect = util::make_unique<XMLElement>("rect");
rect->addAttribute("x", minX());
rect->addAttribute("y", minY());
rect->addAttribute("width", width());
rect->addAttribute("height", height());
rect->addAttribute("fill", "none");
return rect;
}
|
