GRASS logo

NAME

v.delaunay - Create a Delaunay triangulation from an input vector of points or centroids.

SYNOPSIS

v.delaunay
v.delaunay help
v.delaunay [-rl] input=name output=name

Flags:

-r
Use only sites in current region
-l
Output triangulation as a graph (lines), not areas

Parameters:

input=name
Name of input vector map
output=name
Name of output vector map

DESCRIPTION

v.delaunay uses an existing vector points map (input) to create a Delaunay triangulation vector (output).

REFERENCES

Steve J. Fortune, (1987). A Sweepline Algorithm for Voronoi Diagrams, Algorithmica 2, 153-174.

SEE ALSO

v.voronoi, 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: 2006/02/13 15:57:59 $


Main index - vector index - Full index