-
-
Notifications
You must be signed in to change notification settings - Fork 3k
/
qgsalgorithmconvexhull.cpp
93 lines (78 loc) · 3.04 KB
/
qgsalgorithmconvexhull.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
/***************************************************************************
qgsalgorithmconvexhull.cpp
---------------------
begin : April 2017
copyright : (C) 2017 by Nyall Dawson
email : nyall dot dawson at gmail 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 "qgsalgorithmconvexhull.h"
///@cond PRIVATE
QString QgsConvexHullAlgorithm::name() const
{
return QStringLiteral( "convexhull" );
}
QString QgsConvexHullAlgorithm::displayName() const
{
return QObject::tr( "Convex hull" );
}
QStringList QgsConvexHullAlgorithm::tags() const
{
return QObject::tr( "convex,hull,bounds,bounding" ).split( ',' );
}
QString QgsConvexHullAlgorithm::group() const
{
return QObject::tr( "Vector geometry" );
}
QString QgsConvexHullAlgorithm::groupId() const
{
return QStringLiteral( "vectorgeometry" );
}
QString QgsConvexHullAlgorithm::outputName() const
{
return QObject::tr( "Convex hulls" );
}
QString QgsConvexHullAlgorithm::shortHelpString() const
{
return QObject::tr( "This algorithm calculates the convex hull for each feature in an input layer." ) +
QStringLiteral( "\n\n" ) +
QObject::tr( "See the 'Minimum bounding geometry' algorithm for a convex hull calculation which covers the whole layer or grouped subsets of features." );
}
QgsConvexHullAlgorithm *QgsConvexHullAlgorithm::createInstance() const
{
return new QgsConvexHullAlgorithm();
}
QgsFields QgsConvexHullAlgorithm::outputFields( const QgsFields &inputFields ) const
{
QgsFields fields = inputFields;
fields.append( QgsField( QStringLiteral( "area" ), QVariant::Double, QString(), 20, 6 ) );
fields.append( QgsField( QStringLiteral( "perimeter" ), QVariant::Double, QString(), 20, 6 ) );
return fields;
}
QgsFeature QgsConvexHullAlgorithm::processFeature( const QgsFeature &feature, QgsProcessingContext &, QgsProcessingFeedback *feedback )
{
QgsFeature f = feature;
if ( f.hasGeometry() )
{
QgsGeometry outputGeometry = f.geometry().convexHull();
if ( !outputGeometry )
feedback->reportError( outputGeometry.lastError() );
f.setGeometry( outputGeometry );
if ( outputGeometry )
{
QgsAttributes attrs = f.attributes();
attrs << outputGeometry.constGet()->area()
<< outputGeometry.constGet()->perimeter();
f.setAttributes( attrs );
}
}
return f;
}
///@endcond