GRASS logo

NAME

v.delaunay - Creates a Delaunay triangulation from an input vector map containing points or centroids.

KEYWORDS

vector

SYNOPSIS

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

Flags:

-r
Use only points in current region
-l
Output triangulation as a graph (lines), not areas
--overwrite
Allow output files to overwrite existing files
--verbose
Verbose module output
--quiet
Quiet module output

Parameters:

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

DESCRIPTION

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


Delaunay triangulation example:


Delaunay Triangulation

EXAMPLE

Commands used with the Spearfish dataset to create the above figure.
  g.region n=4927250 s=4920000 w=588650 e=605850
  v.delaunay -lr in=archsites out=arch_delaunay
  d.vect map=arch_delaunay color=0:0:255

REFERENCES

Leonid 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-123

SEE ALSO

v.voronoi, v.hull

AUTHORS

Martin Pavlovsky, Google Summer of Code 2008, Student
Paul Kelly, Mentor
Based on "dct" by Geoff Leach, Department of Computer Science, RMIT.

Last changed: $Date: (Mon, 18 Aug 2008) $


Main index - vector index - Full index

© 2003-2010 GRASS Development Team