|
NAMEv.delaunay - Creates a Delaunay triangulation from an input vector map containing points or centroids.KEYWORDSvector, geometry, triangulationSYNOPSISv.delaunayv.delaunay --help v.delaunay [-rl] input=name [layer=string] output=name [--overwrite] [--help] [--verbose] [--quiet] [--ui] Flags:
Parameters:
DESCRIPTIONv.delaunay uses an existing vector points map (input) to create a Delaunay triangulation vector map (output).Delaunay triangulation example (red-yellow points are the data points from which the triangulation was generated): EXAMPLECommands used with the North Carolina dataset to create the above figure (subset shown in figure).g.region n=220750 s=219950 w=638300 e=639000 -p v.delaunay input=elev_lid792_randpts output=elev_lid792_randpts_delaunay REFERENCESLeonid Guibas and Jorge Stolfi, (1985). Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams, ACM Transactions on Graphics, Vol 4, No. 2, April 1985, Pages 74-123SEE ALSOv.voronoi, v.hullAUTHORSMartin Pavlovsky, Google Summer of Code 2008, StudentPaul Kelly, Mentor Based on "dct" by Geoff Leach, Department of Computer Science, RMIT. SOURCE CODEAvailable at: v.delaunay source code (history)Main index | Vector index | Topics index | Keywords index | Graphical index | Full index © 2003-2021 GRASS Development Team, GRASS GIS 7.8.6 Reference Manual
Visit the GSP FreeBSD Man Page Interface. |