voronoi function

Voronoi diagram and Delaunay triangles

Voronoi diagram and Delaunay triangles

Get a Voronoi diagram or Delaunay triangles for points, or the nodes of lines or polygons

## S4 method for signature 'SpatVector' voronoi(x, bnd=NULL, tolerance=0, as.lines=FALSE, deldir=FALSE) ## S4 method for signature 'SpatVector' delaunay(x, tolerance=0, as.lines=FALSE, constrained=FALSE)

Arguments

  • x: SpatVector
  • bnd: SpatVector to set the outer boundary of the voronoi diagram
  • tolerance: numeric >= 0, snapping tolerance (0 is no snapping)
  • as.lines: logical. If TRUE, lines are returned without the outer boundary
  • constrained: logical. If TRUE, a constrained delaunay triangulation is returned
  • deldir: logical. If TRUE, the deldir is used instead of the GEOS C++ library method. It has been reported that deldir does not choke on very large data sets

Returns

SpatVector

Examples

wkt <- c("MULTIPOLYGON ( ((40 40, 20 45, 45 30, 40 40)), ((20 35, 10 30, 10 10, 30 5, 45 20, 20 35),(30 20, 20 15, 20 25, 30 20)))", "POLYGON ((0 -5, 10 0, 10 -10, 0 -5))") x <- vect(wkt) v <- voronoi(x) v d <- delaunay(x) d plot(v, lwd=2, col=rainbow(15)) lines(x, col="gray", lwd=2) points(x)
  • Maintainer: Robert J. Hijmans
  • License: GPL (>= 3)
  • Last published: 2025-02-26