# delaunay.network

From spatstat v1.41-1
by Adrian Baddeley

##### Linear Network of Delaunay Triangulation or Dirichlet Tessellation

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`

##### 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`

.

##### Value

- Linear network (object of class
`"linnet"`

) or`NULL`

.

##### See Also

##### Examples

```
LE <- delaunay.network(cells)
LI <- dirichlet.network(cells)
```

*Documentation reproduced from package spatstat, version 1.41-1, License: GPL (>= 2)*

### Community examples

Looks like there are no examples yet.