NAME
v.delaunay - Create a Delaunay triangulation from an input vector of points or centroids.
SYNOPSIS
v.delaunay
v.delaunay help
v.delaunay [-al] input=string output=string
Flags:
- -a
- Use all sites (do not limit to current region)
- -l
- Output triangulation as a graph (lines), not areas
Parameters:
- input=string
- Name of input vector
- output=string
- Name of output vector
DESCRIPTION
v.voronoi uses an existing vector points map (input) to create a Voronoi
diagram (Thiessen polygons) in a binary vector file (output).
NOTES
v.voronoi can be run either non-interactively or interactively.
The program will be run non-interactively if the user specifies the name of
an existing vector points map and a name for a output vector map.
REFERENCES
Steve J. Fortune, (1987). A Sweepline Algorithm for
Voronoi Diagrams, Algorithmica 2, 153-174.
SEE ALSO
v.clean,
v.hull,
AUTHOR
James Darrell McCauley, Purdue University
GRASS 5 update, improvements: Andrea Aime, Modena, Italy
GRASS 5.7 update: Radim Blazek
Last changed: $Date: 2004/10/04 07:27:31 $
Help Index