sharpetronics/QGIS
1
0
Fork 0
mirror of https://github.com/qgis/QGIS.git synced 2025-04-15 00:04:00 -04:00
Code Issues Packages Projects Releases Wiki Activity

add delaunay triangulation to the help xml file

Browse Source 
git-svn-id: http://svn.osgeo.org/qgis/trunk@10832 c8812cc2-4d05-0410-92ff-de0c093fc19c
This commit is contained in:
cfarmer 2009-05-21 11:56:00 +00:00
parent 0dc679b713
commit 38705646e9
1 changed files with 188 additions and 180 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
python/plugins/fTools/ftools_help.xml
View File

@ -205,7 +205,15 @@
<description>Calculate the true centroids, or 'center of mass' for each polygon in an input polygon layer.</description>
<image>icons/gis/centroids.png</image>
<category>Geometry Tools</category>
<long_description>Inputs, parameters, and additional information to be added</long_description>
<long_description>The centroid of a convex polygon will always lie inside the polygon, however many non-convex polygons may have a centroid that is outside the polygon itself. The centroid of a ring polygon, for example, will lie in the polygons's central void.</long_description>
</ftools_function>
<ftools_function>
<name>Delaunay triangulation</name>
<description>Generate a Delaunay triangulation as a polygon vector layer from a set of input points.</description>
<image>icons/gis/centroids.png</image>
<category>Geometry Tools</category>
<long_description>The Delaunay triangulation for a set of points in the plane is a triangulation such that no point is inside the circumcircle of any triangle in the triangulation. The Delaunay triangulation of a discrete point set corresponds to the dual graph of the Voronoi tessellation of the same point set.</long_description>
</ftools_function>
<ftools_function>
@ -213,7 +221,7 @@
<description>Simplify (generalise) line or polygon vector layers using (a modified) Douglas-Peucker algorithm.</description>
<image>icons/gis/simplify.png</image>
<category>Geometry Tools</category>
<long_description>Inputs, parameters, and additional information to be added</long_description>
<long_description>The purpose of the Douglas-Peucker algorithm is to find a line (or polygon) not too dissimilar but that has fewer points than the given input line (or polygon). The algorithm defines 'too dissimilar' based on the maximum distance between the original curve and the smoothed curve (tolerance). The smoothed line consists of a subset of the points that defined the original line.</long_description>
</ftools_function>
<ftools_function>