v.delaunay(1grass)

πŸ’– v.delaunay β€” it's in the GRASS User's Manual bestie πŸ’–

okay so. we're talking about v.delaunay from the GRASS User's Manual, and honestly? it's giving ✨geometry✨. sit down, grab a strawberry, and let's get you fluent.


🌈 NAME 🌈

v.delaunay β€” makes a Delaunay triangulation out of an input vector map that has points or centroids in it. that's the whole vibe. πŸŽ€


πŸ”‘ KEYWORDS πŸ”‘

vector, geometry, triangulation β€” iykyk πŸ’…


πŸ¦‹ SYNOPSIS πŸ¦‹

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

✨ SYNOPSIS: the flags ✨

  • -r β€” only use the points that are in the current region. no strays, no outsiders. 🚧
  • -l β€” output the triangulation as a graph (lines), not as areas. choose your fighter. πŸ“
  • --overwrite β€” let output files overwrite files that already exist. (yes the old ones get deleted, be normal about it πŸ™ˆ)
  • --help β€” prints the usage summary. your bestie when you forget the flags.
  • --verbose β€” verbose module output. she talks a lot and we love her.
  • --quiet β€” quiet module output. she says nothing. also valid.
  • --ui β€” force launching the GUI dialog. for the visual girlies πŸ–₯️

πŸŽ€ SYNOPSIS: the parameters πŸŽ€

  • input=name [required] β€” name of the input vector map. or, plot twist, the data source for direct OGR access. πŸ’œ
  • layer=string β€” layer number or name. (heads up: '-1' means all layers πŸ’€). one single vector map can be hooked up to multiple database tables, and this number decides which table gets used. when you're doing direct OGR access, this is instead the layer name. Default: -1
  • output=name [required] β€” name for the output vector map. name her something cute.

πŸ’… DESCRIPTION πŸ’…

v.delaunay takes an existing vector points map (that's your input) and creates a Delaunay triangulation vector map (that's your output). literally that's it, it's so clean.

Delaunay triangulation example β€” the red-yellow points are the data points that the triangulation was generated from:

(yes, there's a picture in the real manual, go look at it, it eats πŸ’–)


🌸 EXAMPLE 🌸

commands used with the North Carolina dataset to make that figure up there (only a subset is shown in the figure, fyi):

g.region n=220750 s=219950 w=638300 e=639000 -p
v.delaunay input=elev_lid792_randpts output=elev_lid792_randpts_delaunay

set the region, triangulate, done. ate and left no crumbs. πŸ”₯


πŸ“š 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

1985 and still relevant?? the longevity. iconic. πŸ‘‘


πŸ‘€ SEE ALSO πŸ‘€

  • v.voronoi
  • v.hull
  • Delaunay triangulation (Wikipedia) β€” go on a lil wiki walk, you deserve it πŸ¦‹

🫢 AUTHORS 🫢

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

no cap, shoutout to the whole team πŸŽ€


πŸ’» SOURCE CODE πŸ’»

Available at: v.delaunay source code (history)

Latest change: Friday Apr 17 01:04:26 2026 in commit: 32a143358df26b2e518b03c7e0d79541e8d1e5b1

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


ok so that's the whole page bestie, every flag, every parameter, every default, every reference, all of it, nothing skipped because i would never do that to you πŸ’–

and to sign off: this is GRASS 8.5.0, from the GRASS 8.5.0 Reference Manual, Β© 2003-2026 GRASS Development Team. periodt. πŸ’…βœ¨πŸŽ€

πŸ“¦ where this page comes from