Distance Map of Window
Computes the distance from each pixel to the nearest point in the given window.
## S3 method for class 'owin': distmap(X, \dots, discretise=FALSE, invert=FALSE)
- A window (object of class
- Arguments passed to
as.maskto control pixel resolution.
- Logical flag controlling the choice of algorithm when
Xis a polygonal window. See Details.
TRUE, compute the distance transform of the complement of the window.
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
and returns the distance map as a pixel image. The greyscale value
at a pixel $u$ equals the distance from $u$ to the nearest
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.
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).
X is a polygonal window, then exact Euclidean distances
will be computed if
then the window will first be converted to a binary pixel mask
and the discrete path distances will be computed.
- 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.
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.
data(letterR) U <- distmap(letterR) plot(U) plot(attr(U, "bdry"))