GRASS logo


v.delaunay3d - Creates a 3D triangulation from an input vector map containing points or centroids.


vector, geometry, 3D triangulation


v.delaunay3d --help
v.delaunay3d [-pl] input=name [layer=string] output=name [--overwrite] [--help] [--verbose] [--quiet] [--ui]


Perform plain triangulation
Output triangulation as a graph (lines), not faces
Allow output files to overwrite existing files
Print usage summary
Verbose module output
Quiet module output
Force launching GUI dialog


input=name [required]
Name of input vector map
Or data source for direct OGR access
Layer number or name ('-1' for all layers)
A single vector map can be connected to multiple database tables. This number determines which table to use. When used with direct OGR access this is the layer name.
Default: -1
output=name [required]
Name for output vector map

Table of contents


v.delaunay3d performs 3D Delaunay triangulation on input 3D vector point map. Resultant facets (ie. triangles) of tetrahedral network (TEN) are written as faces to the output vector map. If -l flag is given, the module writes edges of the network as lines instead of faces. By -p flag the user can perform plain 3D triangulation instead of Delaunay triangulation. In the plain triangulation the facets depends on the insertion order of the vertices.


3D triangulation is performed by CGAL library.

Centroids are treated as points when reading data from the input vector map. Note that input vector map must be 3D, the output is always 3D.


# generate random 3D points
v.random out=rp n=100 zmax=100 -z
# perform 3D triangulation
v.delaunay3d input=rp output=rp_ten
Number of vertices: 100
Number of edges: 626
Number of triangles: 1019
Number of tetrahedrons: 492



Martin Landa, Czech Technical University in Prague, Czech Republic


Available at: v.delaunay3d source code (history)

Main index | Vector index | Topics index | Keywords index | Graphical index | Full index

© 2003-2020 GRASS Development Team, GRASS GIS 7.8.3dev Reference Manual