/
qgsabstractgeometry.cpp
400 lines (343 loc) · 9.27 KB
/
qgsabstractgeometry.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
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
/***************************************************************************
qgsabstractgeometry.cpp
-------------------------------------------------------------------
Date : 04 Sept 2014
Copyright : (C) 2014 by Marco Hugentobler
email : marco.hugentobler at sourcepole dot com
***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#include "qgsapplication.h"
#include "qgsabstractgeometry.h"
#include "qgswkbptr.h"
#include "qgsgeos.h"
#include "qgsmaptopixel.h"
#include "qgspointv2.h"
#include <limits>
#include <QTransform>
QgsAbstractGeometry::QgsAbstractGeometry(): mWkbType( QgsWkbTypes::Unknown )
{
}
QgsAbstractGeometry::QgsAbstractGeometry( const QgsAbstractGeometry &geom )
{
mWkbType = geom.mWkbType;
}
QgsAbstractGeometry &QgsAbstractGeometry::operator=( const QgsAbstractGeometry &geom )
{
if ( &geom != this )
{
clear();
mWkbType = geom.mWkbType;
}
return *this;
}
bool QgsAbstractGeometry::is3D() const
{
return QgsWkbTypes::hasZ( mWkbType );
}
bool QgsAbstractGeometry::isMeasure() const
{
return QgsWkbTypes::hasM( mWkbType );
}
void QgsAbstractGeometry::setZMTypeFromSubGeometry( const QgsAbstractGeometry *subgeom, QgsWkbTypes::Type baseGeomType )
{
if ( !subgeom )
{
return;
}
//special handling for 25d types:
if ( baseGeomType == QgsWkbTypes::LineString &&
( subgeom->wkbType() == QgsWkbTypes::Point25D || subgeom->wkbType() == QgsWkbTypes::LineString25D ) )
{
mWkbType = QgsWkbTypes::LineString25D;
return;
}
else if ( baseGeomType == QgsWkbTypes::Polygon &&
( subgeom->wkbType() == QgsWkbTypes::Point25D || subgeom->wkbType() == QgsWkbTypes::LineString25D ) )
{
mWkbType = QgsWkbTypes::Polygon25D;
return;
}
bool hasZ = subgeom->is3D();
bool hasM = subgeom->isMeasure();
if ( hasZ && hasM )
{
mWkbType = QgsWkbTypes::addM( QgsWkbTypes::addZ( baseGeomType ) );
}
else if ( hasZ )
{
mWkbType = QgsWkbTypes::addZ( baseGeomType );
}
else if ( hasM )
{
mWkbType = QgsWkbTypes::addM( baseGeomType );
}
else
{
mWkbType = baseGeomType;
}
}
QgsRectangle QgsAbstractGeometry::calculateBoundingBox() const
{
double xmin = std::numeric_limits<double>::max();
double ymin = std::numeric_limits<double>::max();
double xmax = -std::numeric_limits<double>::max();
double ymax = -std::numeric_limits<double>::max();
QgsVertexId id;
QgsPointV2 vertex;
double x, y;
while ( nextVertex( id, vertex ) )
{
x = vertex.x();
y = vertex.y();
if ( x < xmin )
xmin = x;
if ( x > xmax )
xmax = x;
if ( y < ymin )
ymin = y;
if ( y > ymax )
ymax = y;
}
return QgsRectangle( xmin, ymin, xmax, ymax );
}
void QgsAbstractGeometry::clearCache() const
{
}
int QgsAbstractGeometry::nCoordinates() const
{
int nCoords = 0;
Q_FOREACH ( const QgsRingSequence &r, coordinateSequence() )
{
Q_FOREACH ( const QgsPointSequence &p, r )
{
nCoords += p.size();
}
}
return nCoords;
}
double QgsAbstractGeometry::length() const
{
return 0.0;
}
double QgsAbstractGeometry::perimeter() const
{
return 0.0;
}
double QgsAbstractGeometry::area() const
{
return 0.0;
}
QString QgsAbstractGeometry::wktTypeStr() const
{
QString wkt = geometryType();
if ( is3D() )
wkt += 'Z';
if ( isMeasure() )
wkt += 'M';
return wkt;
}
QgsPointV2 QgsAbstractGeometry::centroid() const
{
// http://en.wikipedia.org/wiki/Centroid#Centroid_of_polygon
// Pick the first ring of first part for the moment
int n = vertexCount( 0, 0 );
if ( n == 1 )
{
return vertexAt( QgsVertexId( 0, 0, 0 ) );
}
double A = 0.;
double Cx = 0.;
double Cy = 0.;
QgsPointV2 v0 = vertexAt( QgsVertexId( 0, 0, 0 ) );
int i = 0, j = 1;
if ( vertexAt( QgsVertexId( 0, 0, 0 ) ) != vertexAt( QgsVertexId( 0, 0, n - 1 ) ) )
{
i = n - 1;
j = 0;
}
for ( ; j < n; i = j++ )
{
QgsPointV2 vi = vertexAt( QgsVertexId( 0, 0, i ) );
QgsPointV2 vj = vertexAt( QgsVertexId( 0, 0, j ) );
vi.rx() -= v0.x();
vi.ry() -= v0.y();
vj.rx() -= v0.x();
vj.ry() -= v0.y();
double d = vi.x() * vj.y() - vj.x() * vi.y();
A += d;
Cx += ( vi.x() + vj.x() ) * d;
Cy += ( vi.y() + vj.y() ) * d;
}
if ( A < 1E-12 )
{
Cx = Cy = 0.;
for ( int i = 0; i < n - 1; ++i )
{
QgsPointV2 vi = vertexAt( QgsVertexId( 0, 0, i ) );
Cx += vi.x();
Cy += vi.y();
}
return QgsPointV2( Cx / ( n - 1 ), Cy / ( n - 1 ) );
}
else
{
return QgsPointV2( v0.x() + Cx / ( 3. * A ), v0.y() + Cy / ( 3. * A ) );
}
}
bool QgsAbstractGeometry::convertTo( QgsWkbTypes::Type type )
{
if ( type == mWkbType )
return true;
if ( QgsWkbTypes::flatType( type ) != QgsWkbTypes::flatType( mWkbType ) )
return false;
bool needZ = QgsWkbTypes::hasZ( type );
bool needM = QgsWkbTypes::hasM( type );
if ( !needZ )
{
dropZValue();
}
else if ( !is3D() )
{
addZValue();
}
if ( !needM )
{
dropMValue();
}
else if ( !isMeasure() )
{
addMValue();
}
return true;
}
QgsVertexIterator QgsAbstractGeometry::vertices() const
{
return QgsVertexIterator( this );
}
bool QgsAbstractGeometry::hasChildGeometries() const
{
return QgsWkbTypes::isMultiType( wkbType() ) || dimension() == 2;
}
QgsPointV2 QgsAbstractGeometry::childPoint( int index ) const
{
Q_UNUSED( index );
return QgsPointV2();
}
bool QgsAbstractGeometry::isEmpty() const
{
QgsVertexId vId;
QgsPointV2 vertex;
return !nextVertex( vId, vertex );
}
bool QgsAbstractGeometry::hasCurvedSegments() const
{
return false;
}
QgsAbstractGeometry *QgsAbstractGeometry::segmentize( double tolerance, SegmentationToleranceType toleranceType ) const
{
Q_UNUSED( tolerance );
Q_UNUSED( toleranceType );
return clone();
}
QgsAbstractGeometry *QgsAbstractGeometry::toCurveType() const
{
return 0;
}
QgsAbstractGeometry::vertex_iterator::vertex_iterator( const QgsAbstractGeometry *g, int index )
: depth( 0 )
{
::memset( levels, 0, sizeof( Level ) * 3 ); // make sure we clean up also the padding areas (for memcmp test in operator==)
levels[0].g = g;
levels[0].index = index;
digDown(); // go to the leaf level of the first vertex
}
QgsAbstractGeometry::vertex_iterator &QgsAbstractGeometry::vertex_iterator::operator++()
{
if ( depth == 0 && levels[0].index >= levels[0].g->childCount() )
return *this; // end of geometry - nowhere else to go
Q_ASSERT( !levels[depth].g->hasChildGeometries() ); // we should be at a leaf level
++levels[depth].index;
// traverse up if we are at the end in the current level
while ( depth > 0 && levels[depth].index >= levels[depth].g->childCount() )
{
--depth;
++levels[depth].index;
}
digDown(); // go to the leaf level again
return *this;
}
QgsAbstractGeometry::vertex_iterator QgsAbstractGeometry::vertex_iterator::operator++( int )
{
vertex_iterator it( *this );
++*this;
return it;
}
QgsPointV2 QgsAbstractGeometry::vertex_iterator::operator*() const
{
Q_ASSERT( !levels[depth].g->hasChildGeometries() );
return levels[depth].g->childPoint( levels[depth].index );
}
QgsVertexId QgsAbstractGeometry::vertex_iterator::vertexId() const
{
int part = 0, ring = 0, vertex = levels[depth].index;
if ( depth == 0 )
{
// nothing else to do
}
else if ( depth == 1 )
{
if ( QgsWkbTypes::isMultiType( levels[0].g->wkbType() ) )
part = levels[0].index;
else
ring = levels[0].index;
}
else if ( depth == 2 )
{
part = levels[0].index;
ring = levels[1].index;
}
else
{
Q_ASSERT( false );
return QgsVertexId();
}
// get the vertex type: find out from the leaf geometry
QgsVertexId::VertexType vertexType = QgsVertexId::SegmentVertex;
if ( const QgsCurve *curve = dynamic_cast<const QgsCurve *>( levels[depth].g ) )
{
QgsPointV2 p;
curve->pointAt( vertex, p, vertexType );
}
return QgsVertexId( part, ring, vertex, vertexType );
}
bool QgsAbstractGeometry::vertex_iterator::operator==( const QgsAbstractGeometry::vertex_iterator &other ) const
{
if ( depth != other.depth )
return false;
int res = ::memcmp( levels, other.levels, sizeof( Level ) * ( depth + 1 ) );
return res == 0;
}
void QgsAbstractGeometry::vertex_iterator::digDown()
{
if ( levels[depth].g->hasChildGeometries() && levels[depth].index >= levels[depth].g->childCount() )
return; // first check we are not already at the end
// while not "final" depth for the geom: go one level down.
while ( levels[depth].g->hasChildGeometries() )
{
++depth;
Q_ASSERT( depth < 3 ); // that's capacity of the levels array
levels[depth].index = 0;
levels[depth].g = levels[depth - 1].g->childGeometry( levels[depth - 1].index );
}
}
QgsPointV2 QgsVertexIterator::next()
{
n = i++;
return *n;
}