
inside.owin(x, y, w)
i
th entry is
TRUE
if the corresponding point (x[i],y[i])
is inside w
.(x[i],y[i])
lies inside or outside
the window w
and returns TRUE
if it is inside.
The boundary of the window is treated as being inside. If w
is of type "rectangle"
or
"polygonal"
, the algorithm uses analytic geometry
(the discrete Stokes theorem).
Computation time is linear in the number of points
and (for polygonal windows) in the number of vertices of the
boundary polygon. Boundary cases are correct to single
precision accuracy.
If w
is of type "mask"
then the
pixel closest to (x[i],y[i])
is tested. The
results may be incorrect for points lying within
one pixel diameter of the window boundary.
owin.object
,
as.owin
library(spatstat)
# hexagonal window
k <- 6
theta <- 2 * pi * (0:(k-1))/k
co <- cos(theta)
si <- sin(theta)
mas <- owin(c(-1,1), c(-1,1), poly=list(x=co, y=si))
plot(mas)
# random points in rectangle
x <- runif(30,min=-1, max=1)
y <- runif(30,min=-1, max=1)
ok <- inside.owin(x, y, mas)
points(x[ok], y[ok])
points(x[!ok], y[!ok], pch="x")
Run the code above in your browser using DataLab