sharpetronics/QGIS
1
0
Fork 0
mirror of https://github.com/qgis/QGIS.git synced 2025-02-27 00:33:48 -05:00
Code Issues Packages Projects Releases Wiki Activity

Use US spelling for neighbor

Browse Source
This commit is contained in:
Rudi von Staden 2018-09-14 10:05:20 +02:00
parent f4cab1780a
commit 858cd266c7
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
python/plugins/processing/algs/qgis/KNearestConcaveHull.py
View File

@ -63,10 +63,10 @@ class KNearestConcaveHull(QgisAlgorithm):
return 'knearestconcavehull'
def displayName(self):
return self.tr('Concave hull (k-nearest neighbour)')
return self.tr('Concave hull (k-nearest neighbor)')
def shortDescription(self):
return self.tr('Creates a concave hull using the k-nearest neighbour algorithm.')
return self.tr('Creates a concave hull using the k-nearest neighbor algorithm.')
def icon(self):
return QgsApplication.getThemeIcon("/algorithms/mAlgorithmConcaveHull.svg")
@ -168,7 +168,6 @@ class KNearestConcaveHull(QgisAlgorithm):
else:
# Not grouped by field
# Initialize writer
(sink, dest_id) = self.parameterAsSink(parameters, self.OUTPUT, context,
fields, QgsWkbTypes.Polygon, source.sourceCrs())
@ -440,7 +439,7 @@ def concave_hull(points_list, k):
without intersecting any previous line segments.
This is an implementation of the algorithm described by Adriano Moreira and Maribel Yasmina Santos:
CONCAVE HULL: A neighborhood_k-NEAREST NEIGHBOURS APPROACH FOR THE COMPUTATION OF THE REGION OCCUPIED BY A SET OF POINTS.
CONCAVE HULL: A neighborhood_k-NEAREST NEIGHBORS APPROACH FOR THE COMPUTATION OF THE REGION OCCUPIED BY A SET OF POINTS.
GRAPP 2007 - International Conference on Computer Graphics Theory and Applications; pp 61-68.
:param points_list: list of tuples (x, y)
@ -466,7 +465,7 @@ def concave_hull(points_list, k):
if len(point_set) == 3:
return add_point(point_set, point_set[0])
# make sure that k neighbours can be found
# make sure that k neighbors can be found
kk = min(kk, len(point_set))
# start with the point having the smallest y-coordinate (most southern point)