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
|
/**
* Copyright (C) 2012 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the GNU Affero General Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#include "mongo/db/geo/s2common.h"
#include "mongo/db/geo/geoconstants.h"
#include "mongo/db/geo/geoparser.h"
#include "mongo/db/geo/geoquery.h"
#include "mongo/db/geo/s2.h"
#include "third_party/s2/s2cell.h"
#include "third_party/s2/s2regioncoverer.h"
namespace mongo {
static string myitoa(int d) {
stringstream ss;
ss << d;
return ss.str();
}
double dist(const S2Point& a, const S2Point& b) {
S1Angle angle(a, b);
return angle.radians();
}
double dist(const S2Point& a, const MultiPointWithCRS& b) {
double minDist = numeric_limits<double>::max();
for (size_t i = 0; i < b.points.size(); ++i) {
minDist = min(minDist, dist(a, b.points[i]));
}
return minDist;
}
double dist(const S2Point& a, const S2Polyline& b) {
int tmp;
S1Angle angle(a, b.Project(a, &tmp));
return angle.radians();
}
double dist(const S2Point& a, const MultiLineWithCRS& b) {
double minDist = numeric_limits<double>::max();
for (size_t i = 0; i < b.lines.vector().size(); ++i) {
minDist = min(minDist, dist(a, *b.lines.vector()[i]));
}
return minDist;
}
double dist(const S2Point& a, const S2Polygon& b) {
S1Angle angle(a, b.Project(a));
return angle.radians();
}
double dist(const S2Point& a, const MultiPolygonWithCRS& b) {
double minDist = numeric_limits<double>::max();
for (size_t i = 0; i < b.polygons.vector().size(); ++i) {
minDist = min(minDist, dist(a, *b.polygons.vector()[i]));
}
return minDist;
}
bool S2SearchUtil::distanceBetween(const S2Point& us, const BSONObj& them, double *out) {
if (GeoParser::isGeometryCollection(them)) {
GeometryCollection c;
if (!GeoParser::parseGeometryCollection(them, &c)) { return false; }
double minDist = numeric_limits<double>::max();
for (size_t i = 0; i < c.points.size(); ++i) {
minDist = min(minDist, dist(us, c.points[i].point));
}
const vector<LineWithCRS*>& lines = c.lines.vector();
for (size_t i = 0; i < lines.size(); ++i) {
minDist = min(minDist, dist(us, lines[i]->line));
}
const vector<PolygonWithCRS*>& polys = c.polygons.vector();
for (size_t i = 0; i < polys.size(); ++i) {
minDist = min(minDist, dist(us, polys[i]->polygon));
}
const vector<MultiPointWithCRS*>& multipoints = c.multiPoints.vector();
for (size_t i = 0; i < multipoints.size(); ++i) {
MultiPointWithCRS* mp = multipoints[i];
for (size_t j = 0; j < mp->points.size(); ++j) {
minDist = min(minDist, dist(us, mp->points[i]));
}
}
const vector<MultiLineWithCRS*>& multilines = c.multiLines.vector();
for (size_t i = 0; i < multilines.size(); ++i) {
const vector<S2Polyline*>& lines = multilines[i]->lines.vector();
for (size_t j = 0; j < lines.size(); ++j) {
minDist = min(minDist, dist(us, *lines[j]));
}
}
const vector<MultiPolygonWithCRS*>& multipolys = c.multiPolygons.vector();
for (size_t i = 0; i < multipolys.size(); ++i) {
const vector<S2Polygon*>& polys = multipolys[i]->polygons.vector();
for (size_t j = 0; j < polys.size(); ++j) {
minDist = min(minDist, dist(us, *polys[j]));
}
}
*out = kRadiusOfEarthInMeters * minDist;
return true;
} else if (GeoParser::isMultiPoint(them)) {
MultiPointWithCRS multiPoint;
if (!GeoParser::parseMultiPoint(them, &multiPoint)) { return false; }
*out = dist(us, multiPoint) * kRadiusOfEarthInMeters;
return true;
} else if (GeoParser::isMultiLine(them)) {
MultiLineWithCRS multiLine;
if (!GeoParser::parseMultiLine(them, &multiLine)) { return false; }
*out = dist(us, multiLine) * kRadiusOfEarthInMeters;
return true;
} else if (GeoParser::isMultiPolygon(them)) {
MultiPolygonWithCRS multiPolygon;
if (!GeoParser::parseMultiPolygon(them, &multiPolygon)) { return false; }
*out = dist(us, multiPolygon) * kRadiusOfEarthInMeters;
return true;
} else if (GeoParser::isPolygon(them)) {
PolygonWithCRS poly;
if (!GeoParser::parsePolygon(them, &poly)) { return false; }
*out = dist(us, poly.polygon) * kRadiusOfEarthInMeters;
return true;
} else if (GeoParser::isLine(them)) {
LineWithCRS line;
if (!GeoParser::parseLine(them, &line)) { return false; }
*out = dist(us, line.line) * kRadiusOfEarthInMeters;
return true;
} else if (GeoParser::isPoint(them)) {
PointWithCRS point;
if (!GeoParser::parsePoint(them, &point)) { return false; }
*out = dist(us, point.point) * kRadiusOfEarthInMeters;
return true;
} else {
return false;
}
}
void S2SearchUtil::setCoverLimitsBasedOnArea(double area, S2RegionCoverer *coverer,
int coarsestIndexedLevel) {
area = sqrt(area);
coverer->set_min_level(min(coarsestIndexedLevel, 2 + S2::kAvgEdge.GetClosestLevel(area)));
coverer->set_max_level(4 + coverer->min_level());
}
BSONObj S2SearchUtil::coverAsBSON(const vector<S2CellId> &cover, const string& field,
const int coarsestIndexedLevel) {
BSONObjBuilder queryBuilder;
BSONObjBuilder inBuilder(queryBuilder.subobjStart(field));
// To have an array where elements of that array are regexes, we have to do this.
BSONObjBuilder inArrayBuilder(inBuilder.subarrayStart("$in"));
// Sadly we must keep track of this ourselves. Oh, BSONObjBuilder, you rascal!
int arrayPos = 0;
bool considerCoarser = false;
// Look at the cells we cover and all cells that are within our covering and
// finer. Anything with our cover as a strict prefix is contained within the cover and
// should be intersection tested.
for (size_t i = 0; i < cover.size(); ++i) {
// First argument is position in the array as a string.
// Third argument is options to regex.
inArrayBuilder.appendRegex(myitoa(arrayPos++), "^" + cover[i].toString(), "");
// If any of our covers could be covered by something in the index, we have
// to look at things coarser.
considerCoarser = considerCoarser || (cover[i].level() > coarsestIndexedLevel);
}
if (considerCoarser) {
// Look at the cells that cover us. We want to look at every cell that
// contains the covering we would index on if we were to insert the
// query geometry. We generate the would-index-with-this-covering and
// find all the cells strictly containing the cells in that set, until we hit the
// coarsest indexed cell. We use $in, not a prefix match. Why not prefix? Because
// we've already looked at everything finer or as fine as our initial covering.
//
// Say we have a fine point with cell id 212121, we go up one, get 21212, we don't
// want to look at cells 21212[not-1] because we know they're not going to intersect
// with 212121, but entries inserted with cell value 21212 (no trailing digits) may.
// And we've already looked at points with the cell id 211111 from the regex search
// created above, so we only want things where the value of the last digit is not
// stored (and therefore could be 1).
unordered_set<S2CellId> parents;
for (size_t i = 0; i < cover.size(); ++i) {
for (S2CellId id = cover[i].parent(); id.level() >= coarsestIndexedLevel;
id = id.parent()) {
parents.insert(id);
}
}
for (unordered_set<S2CellId>::const_iterator it = parents.begin(); it != parents.end(); ++it) {
inArrayBuilder.append(myitoa(arrayPos++), it->toString());
}
}
inArrayBuilder.done();
inBuilder.done();
return queryBuilder.obj();
}
} // namespace mongo
|
