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
|
/*
Copyright (c) 2013, Regents of the University of Alaska
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* Neither the name of the Geographic Information Network of Alaska nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
This code was developed by Dan Stahlke for the Geographic Information Network of Alaska.
*/
#ifndef DANGDAL_POLYGON_H
#define DANGDAL_POLYGON_H
#include <vector>
#include <string>
#include <algorithm>
#include <ogr_api.h>
#include "common.h"
#include "georef.h"
namespace dangdal {
// returned by ring_ring_relation
enum RingRelation {
RINGREL_CONTAINS,
RINGREL_CONTAINED_BY,
RINGREL_CROSSES,
RINGREL_DISJOINT
};
struct Vertex {
Vertex() : x(0), y(0) { }
Vertex(double _x, double _y) : x(_x), y(_y) { }
double x, y;
};
class Bbox {
public:
Bbox() :
min_x(0), max_x(0),
min_y(0), max_y(0),
empty(true)
{ }
void expand(const Vertex &v) {
if(empty) {
empty = false;
min_x = max_x = v.x;
min_y = max_y = v.y;
} else {
if(v.x < min_x) min_x = v.x;
if(v.y < min_y) min_y = v.y;
if(v.x > max_x) max_x = v.x;
if(v.y > max_y) max_y = v.y;
}
}
void expand(const Bbox &bb);
double min_x, max_x, min_y, max_y;
bool empty;
};
Bbox box_union(const Bbox &bb1, const Bbox &bb2);
static inline bool is_disjoint(const Bbox &bb1, const Bbox &bb2) {
return
bb1.empty || bb2.empty ||
bb1.min_x > bb2.max_x ||
bb1.min_y > bb2.max_y ||
bb2.min_x > bb1.max_x ||
bb2.min_y > bb1.max_y;
}
class Ring {
public:
Ring() : is_hole(false), parent_id(-1) { }
Bbox getBbox() const;
double orientedArea() const;
double area() const;
bool isCCW() const;
bool contains(Vertex p) const;
void reverse() { std::reverse(pts.begin(), pts.end()); }
// copy everything except for pts
Ring copyMetadata() const {
Ring ret;
ret.is_hole = is_hole;
ret.parent_id = parent_id;
return ret;
}
std::vector<Vertex> pts;
bool is_hole;
int parent_id;
};
class Mpoly {
public:
Bbox getBbox() const;
std::vector<Bbox> getRingBboxes() const;
bool contains(Vertex p) const;
// Returns true if the given point is contained in the specified ring, but
// not contained in any of that ring's holes.
bool component_contains(Vertex p, int outer_ring_id) const;
void deleteRing(size_t idx);
void xy2en(const GeoRef &georef);
void en2xy(const GeoRef &georef);
void xy2ll_with_interp(const GeoRef &georef, double toler);
std::vector<Ring> rings;
};
OGRGeometryH ring_to_ogr(const Ring &ring);
Ring ogr_to_ring(OGRGeometryH ogr);
OGRGeometryH mpoly_to_ogr(const Mpoly &mpoly_in);
Mpoly ogr_to_mpoly(OGRGeometryH geom_in);
std::vector<Mpoly> split_mpoly_to_polys(const Mpoly &mpoly);
bool line_intersects_line(
Vertex p1, Vertex p2,
Vertex p3, Vertex p4,
bool fail_on_coincident
);
Vertex line_line_intersection(
Vertex p1, Vertex p2,
Vertex p3, Vertex p4
);
RingRelation ring_ring_relation(const Ring &r1, const Ring &r2);
Mpoly mpoly_from_wktfile(const std::string &fn);
} // namespace dangdal
#endif // ifndef DANGDAL_POLYGON_H
|
