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)
- A window (object of class
- Arguments passed to
as.maskto control pixel resolution.
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
For computational efficiency, the distances 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).
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 the window
X is not already a pixellated window
(a binary image mask), it is converted into one. The arguments
... control the pixel resolution in this case, but will
otherwise be ignored.
This function is a method for the generic
- 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"))