-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathgdal_polygonize_mod.cpp
233 lines (193 loc) · 8.44 KB
/
gdal_polygonize_mod.cpp
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
/* @(#)gdal_polygonize_mod.cpp
This code is derived from polygonize.cpp from the gdal source package
* $Id: polygonize.cpp 33757 2016-03-20 20:22:33Z goatbar $
* Project: GDAL
* Purpose: Raster to Polygon Converter
* Author: Frank Warmerdam, [email protected]
*
******************************************************************************
* Copyright (c) 2008, Frank Warmerdam
* Copyright (c) 2009-2011, Even Rouault <even dot rouault at mines-paris dot org>
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
****************************************************************************/
#include "gdal_polygonize_mod.h"
/************************************************************************/
/* Dump() */
/************************************************************************/
void RPolygon::Dump()
{
size_t iString;
printf( "RPolygon: Value=%g, LastLineUpdated=%d\n",
dfPolyValue, nLastLineUpdated );
for( iString = 0; iString < aanXY.size(); iString++ )
{
std::vector<int> &anString = aanXY[iString];
size_t iVert;
printf( " String %d:\n", (int) iString );
for( iVert = 0; iVert < anString.size(); iVert += 2 )
{
printf( " (%d,%d)\n", anString[iVert], anString[iVert+1] );
}
}
}
/************************************************************************/
/* Coalesce() */
/************************************************************************/
void RPolygon::Coalesce()
{
size_t iBaseString;
/* -------------------------------------------------------------------- */
/* Iterate over loops starting from the first, trying to merge */
/* other segments into them. */
/* -------------------------------------------------------------------- */
for( iBaseString = 0; iBaseString < aanXY.size(); iBaseString++ )
{
std::vector<int> &anBase = aanXY[iBaseString];
int bMergeHappened = TRUE;
/* -------------------------------------------------------------------- */
/* Keep trying to merge the following strings into our target */
/* "base" string till we have tried them all once without any */
/* mergers. */
/* -------------------------------------------------------------------- */
while( bMergeHappened )
{
size_t iString;
bMergeHappened = FALSE;
/* -------------------------------------------------------------------- */
/* Loop over the following strings, trying to find one we can */
/* merge onto the end of our base string. */
/* -------------------------------------------------------------------- */
for( iString = iBaseString+1;
iString < aanXY.size();
iString++ )
{
std::vector<int> &anString = aanXY[iString];
if( anBase[anBase.size()-2] == anString[0]
&& anBase[anBase.size()-1] == anString[1] )
{
Merge( static_cast<int>(iBaseString), static_cast<int>(iString), 1 );
bMergeHappened = TRUE;
}
else if( anBase[anBase.size()-2] == anString[anString.size()-2]
&& anBase[anBase.size()-1] == anString[anString.size()-1] )
{
Merge( static_cast<int>(iBaseString), static_cast<int>(iString), -1 );
bMergeHappened = TRUE;
}
}
}
/* At this point our loop *should* be closed! */
CPLAssert( anBase[0] == anBase[anBase.size()-2]
&& anBase[1] == anBase[anBase.size()-1] );
}
}
/************************************************************************/
/* Merge() */
/************************************************************************/
void RPolygon::Merge( int iBaseString, int iSrcString, int iDirection )
{
std::vector<int> &anBase = aanXY[iBaseString];
std::vector<int> &anString = aanXY[iSrcString];
int iStart, iEnd, i;
if( iDirection == 1 )
{
iStart = 1;
iEnd = static_cast<int>(anString.size()) / 2;
}
else
{
iStart = static_cast<int>(anString.size()) / 2 - 2;
iEnd = -1;
}
for( i = iStart; i != iEnd; i += iDirection )
{
anBase.push_back( anString[i*2+0] );
anBase.push_back( anString[i*2+1] );
}
if( iSrcString < ((int) aanXY.size())-1 )
aanXY[iSrcString] = aanXY[aanXY.size()-1];
size_t nSize = aanXY.size();
aanXY.resize(nSize-1);
}
/************************************************************************/
/* AddSegment() */
/************************************************************************/
void RPolygon::AddSegment( int x1, int y1, int x2, int y2 )
{
nLastLineUpdated = MAX(y1, y2);
/* -------------------------------------------------------------------- */
/* Is there an existing string ending with this? */
/* -------------------------------------------------------------------- */
size_t iString;
for( iString = 0; iString < aanXY.size(); iString++ )
{
std::vector<int> &anString = aanXY[iString];
size_t nSSize = anString.size();
if( anString[nSSize-2] == x1
&& anString[nSSize-1] == y1 )
{
int nTemp;
nTemp = x2;
x2 = x1;
x1 = nTemp;
nTemp = y2;
y2 = y1;
y1 = nTemp;
}
if( anString[nSSize-2] == x2
&& anString[nSSize-1] == y2 )
{
// We are going to add a segment, but should we just extend
// an existing segment already going in the right direction?
int nLastLen = MAX(ABS(anString[nSSize-4]-anString[nSSize-2]),
ABS(anString[nSSize-3]-anString[nSSize-1]));
/*
if( nSSize >= 4
&& (anString[nSSize-4] - anString[nSSize-2]
== (anString[nSSize-2] - x1)*nLastLen)
&& (anString[nSSize-3] - anString[nSSize-1]
== (anString[nSSize-1] - y1)*nLastLen) )
{
anString.pop_back();
anString.pop_back();
}
*/
anString.push_back( x1 );
anString.push_back( y1 );
return;
}
}
/* -------------------------------------------------------------------- */
/* Create a new string. */
/* -------------------------------------------------------------------- */
size_t nSize = aanXY.size();
aanXY.resize(nSize + 1);
std::vector<int> &anString = aanXY[nSize];
anString.push_back( x1 );
anString.push_back( y1 );
anString.push_back( x2 );
anString.push_back( y2 );
return;
}
/************************************************************************/
/* ==================================================================== */
/* End of RPolygon */
/* ==================================================================== */
/************************************************************************/