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
|
/**
* Copyright (C) 2018-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* 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
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* 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 Server Side 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.
*/
#pragma once
#include <s2.h>
#include <s2cap.h>
#include <s2cell.h>
#include <s2loop.h>
#include <s2polygon.h>
#include <s2polyline.h>
#include <s2region.h>
#include <vector>
namespace mongo {
// Simple GeoJSON polygon with a custom CRS identifier as having a strict winding order.
// The winding order will determine unambiguously the inside/outside of the polygon even
// if larger than one hemisphere.
//
// BigSimplePolygon uses S2Loop internally, which follows a left-foot rule (inside to the
// left when walking the edge of the polygon, counter-clockwise)
class BigSimplePolygon : public S2Region {
public:
BigSimplePolygon();
BigSimplePolygon(S2Loop* loop);
virtual ~BigSimplePolygon();
void Init(S2Loop* loop);
double GetArea() const;
bool Contains(const S2Polygon& polygon) const;
bool Contains(const S2Polyline& line) const;
// Needs to be this way for S2 compatibility
bool Contains(S2Point const& point) const;
bool Intersects(const S2Polygon& polygon) const;
bool Intersects(const S2Polyline& line) const;
bool Intersects(S2Point const& point) const;
// Only used in tests
void Invert();
const S2Polygon& GetPolygonBorder() const;
const S2Polyline& GetLineBorder() const;
//
// S2Region interface
//
BigSimplePolygon* Clone() const;
S2Cap GetCapBound() const;
S2LatLngRect GetRectBound() const;
bool Contains(S2Cell const& cell) const;
bool MayIntersect(S2Cell const& cell) const;
bool VirtualContainsPoint(S2Point const& p) const;
void Encode(Encoder* encoder) const;
bool Decode(Decoder* decoder);
bool DecodeWithinScope(Decoder* decoder);
private:
std::unique_ptr<S2Loop> _loop;
// Cache whether the loop area is at most 2*Pi (the area of hemisphere).
//
// S2 guarantees that any loop in a valid (normalized) polygon, no matter a hole
// or a shell, has to be less than 2*Pi. So if the loop is normalized, it's the same
// with the border polygon, otherwise, the border polygon is its complement.
bool _isNormalized;
// Cached to do Intersects() and Contains() with S2Polylines.
mutable std::unique_ptr<S2Polyline> _borderLine;
mutable std::unique_ptr<S2Polygon> _borderPoly;
};
} // namespace mongo
|
