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
|
/****************************************************************************
**
** Copyright (C) 2020 Paolo Angelelli <paolo.angelelli@gmail.com>
** Copyright (C) 2022 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtLocation module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qdeclarativegeomapitemutils_p.h"
#include <QPointF>
#include <QMatrix4x4>
#include <QPainterPath>
#include <QPainterPathStroker>
#include <QtPositioning/QGeoCoordinate>
#include <QtPositioning/private/qclipperutils_p.h>
QT_BEGIN_NAMESPACE
namespace QDeclarativeGeoMapItemUtils {
void wrapPath(const QList<QGeoCoordinate> &perimeter,
const QGeoCoordinate &geoLeftBound,
const QGeoProjectionWebMercator &p,
QList<QDoubleVector2D> &wrappedPath,
QList<QDoubleVector2D> &wrappedPathMinus1,
QList<QDoubleVector2D> &wrappedPathPlus1,
QDoubleVector2D *leftBoundWrapped)
{
QList<QDoubleVector2D> path;
for (const QGeoCoordinate &c : perimeter)
path << p.geoToMapProjection(c);
const QDoubleVector2D leftBound = p.geoToMapProjection(geoLeftBound);
wrappedPath.clear();
wrappedPathPlus1.clear();
wrappedPathMinus1.clear();
// compute 3 sets of "wrapped" coordinates: one w regular mercator, one w regular mercator +- 1.0
for (QDoubleVector2D coord : path) {
// We can get NaN if the map isn't set up correctly, or the projection
// is faulty -- probably best thing to do is abort
if (!qIsFinite(coord.x()) || !qIsFinite(coord.y()))
return;
const bool isPointLessThanUnwrapBelowX = (coord.x() < leftBound.x());
// unwrap x to preserve geometry if moved to border of map
if (isPointLessThanUnwrapBelowX)
coord.setX(coord.x() + 1.0);
QDoubleVector2D coordP1(coord.x() + 1.0, coord.y());
QDoubleVector2D coordM1(coord.x() - 1.0, coord.y());
wrappedPath.append(coord);
wrappedPathPlus1.append(coordP1);
wrappedPathMinus1.append(coordM1);
}
if (leftBoundWrapped)
*leftBoundWrapped = leftBound;
}
void wrapPath(const QList<QGeoCoordinate> &perimeter,
const QGeoCoordinate &geoLeftBound,
const QGeoProjectionWebMercator &p,
QList<QDoubleVector2D> &wrappedPath,
QDoubleVector2D *leftBoundWrapped)
{
QList<QDoubleVector2D> path;
for (const QGeoCoordinate &c : perimeter)
path << p.geoToMapProjection(c);
const QDoubleVector2D leftBound = p.geoToMapProjection(geoLeftBound);
wrapPath(path, leftBound,wrappedPath);
if (leftBoundWrapped)
*leftBoundWrapped = leftBound;
}
void wrapPath(const QList<QDoubleVector2D> &path,
const QDoubleVector2D &geoLeftBound,
QList<QDoubleVector2D> &wrappedPath)
{
wrappedPath.clear();
// compute 3 sets of "wrapped" coordinates: one w regular mercator, one w regular mercator +- 1.0
for (QDoubleVector2D coord : path) {
// We can get NaN if the map isn't set up correctly, or the projection
// is faulty -- probably best thing to do is abort
if (!qIsFinite(coord.x()) || !qIsFinite(coord.y()))
return;
const bool isPointLessThanUnwrapBelowX = (coord.x() < geoLeftBound.x());
// unwrap x to preserve geometry if moved to border of map
if (isPointLessThanUnwrapBelowX)
coord.setX(coord.x() + 1.0);
wrappedPath.append(coord);
}
}
void clipPolygon(const QList<QDoubleVector2D> &wrappedPath,
const QGeoProjectionWebMercator &p,
QList<QList<QDoubleVector2D>> &clippedPaths,
QDoubleVector2D *leftBoundWrapped,
bool closed)
{
// 2) Clip bounding box
clippedPaths.clear();
const QList<QDoubleVector2D> &visibleRegion = p.projectableGeometry();
if (visibleRegion.size()) {
QClipperUtils clipper;
clipper.addSubjectPath(wrappedPath, closed);
clipper.addClipPolygon(visibleRegion);
clippedPaths = clipper.execute(QClipperUtils::Intersection, QClipperUtils::pftEvenOdd,
QClipperUtils::pftEvenOdd);
if (leftBoundWrapped) {
// 2.1) update srcOrigin_ and leftBoundWrapped with the point with minimum X
QDoubleVector2D lb(qInf(), qInf());
for (const QList<QDoubleVector2D> &path : clippedPaths) {
for (const QDoubleVector2D &p : path) {
if (p.x() < lb.x() || (p.x() == lb.x() && p.y() < lb.y()))
// y-minimization needed to find the same point on polygon and border
lb = p;
}
}
if (qIsInf(lb.x())) // e.g., when the polygon is clipped entirely
return;
// 2.2) Prevent the conversion to and from clipper from introducing tiny negative offsets which,
// in turn will make the geometry wrap around.
lb.setX(qMax(leftBoundWrapped->x(), lb.x()));
*leftBoundWrapped = lb;
// srcOrigin_ = p.mapProjectionToGeo(p.unwrapMapProjection(lb));
}
} else {
clippedPaths.append(wrappedPath);
}
}
void projectBbox(const QList<QDoubleVector2D> &clippedBbox,
const QGeoProjectionWebMercator &p,
QPainterPath &projectedBbox)
{
projectedBbox.clear();
bool first = true;
for (const auto &coord : clippedBbox) {
QDoubleVector2D point = p.wrappedMapProjectionToItemPosition(coord);
if (first) {
first = false;
projectedBbox.moveTo(point.toPointF());
} else {
projectedBbox.lineTo(point.toPointF());
}
}
projectedBbox.closeSubpath();
}
} // namespace QDeclarativeGeoMapItemUtils
QT_END_NAMESPACE
|
