Learn R Programming

spatstat.geom (version 3.3-2)

distmap.owin: Distance Map of Window

Description

Computes the distance from each pixel to the nearest point in the given window.

Usage

# S3 method for owin
distmap(X, ..., discretise=FALSE, invert=FALSE,
        connect=8, metric=NULL)

Value

A pixel image (object of class "im") whose greyscale values are the values of the distance map. The return value has an attribute "bdry"

which is a pixel image.

Arguments

X

A window (object of class "owin").

...

Arguments passed to as.mask to control pixel resolution.

discretise

Logical flag controlling the choice of algorithm when X is a polygonal window. See Details.

invert

If TRUE, compute the distance transform of the complement of the window.

connect

Neighbourhood connectivity for the discrete distance transform algorithm. Either 8 or 24.

metric

Optional. A distance metric (object of class "metric", see metric.object) which will be used to compute the distances.

Author

Adrian Baddeley Adrian.Baddeley@curtin.edu.au

and Rolf Turner rolfturner@posteo.net

Details

The ``distance map'' of a window \(W\) is the function \(f\) whose value f(u) is defined for any two-dimensional location \(u\) as the shortest distance from \(u\) to \(W\).

This function computes the distance map of the window X and returns the distance map as a pixel image. The greyscale value at a pixel \(u\) equals the distance from \(u\) to the nearest pixel in X.

Additionally, the return value has an attribute "bdry" which is also a pixel image. The grey values in "bdry" give the distance from each pixel to the bounding rectangle of the image.

If X is a binary pixel mask, the distance values computed are not the usual Euclidean distances. Instead the distance between two pixels is measured by the length of the shortest path connecting the two pixels. A path is a series of steps between neighbouring pixels (each pixel has 8 neighbours). This is the standard `distance transform' algorithm of image processing (Rosenfeld and Kak, 1968; Borgefors, 1986).

If X is a polygonal window, then exact Euclidean distances will be computed if discretise=FALSE. If discretise=TRUE then the window will first be converted to a binary pixel mask and the discrete path distances will be computed.

The arguments ... are passed to as.mask to control the pixel resolution.

This function is a method for the generic distmap.

References

Borgefors, G. Distance transformations in digital images. Computer Vision, Graphics and Image Processing 34 (1986) 344--371.

Rosenfeld, A. and Pfalz, J.L. Distance functions on digital pictures. Pattern Recognition 1 (1968) 33-61.

See Also

distmap, distmap.ppp, distmap.psp

Examples

Run this code
  U <- distmap(letterR)
  if(interactive()) {
  plot(U)
  plot(attr(U, "bdry"))
  }

Run the code above in your browser using DataLab