spatstat (version 1.41-1)

delaunay.network: Linear Network of Delaunay Triangulation or Dirichlet Tessellation

Description

Computes the edges of the Delaunay triangulation or Dirichlet tessellation of a point pattern, and returns the result as a linear network object.

Usage

delaunay.network(X)

dirichlet.network(X, ...)

Arguments

X
A point pattern (object of class "ppp").
...
Arguments passed to as.linnet.psp

Value

  • Linear network (object of class "linnet") or NULL.

Details

For delaunay.network, points of X which are neighbours in the Delaunay triangulation (see delaunay) will be joined by a straight line. The result will be returned as a linear network (object of class "linnet").

For dirichlet.network, the Dirichlet tessellation is computed (see dirichlet) and the edges of the tiles of the tessellation are extracted. This is converted to a linear network using as.linnet.psp.

See Also

delaunay, dirichlet, delaunay.distance

Examples

Run this code
LE <- delaunay.network(cells)
  LI <- dirichlet.network(cells)

Run the code above in your browser using DataLab