@@ -58,7 +58,7 @@ A spatial point pattern is assumed to have been observed within a specific
...
@@ -58,7 +58,7 @@ A spatial point pattern is assumed to have been observed within a specific
\item{\code{$marksout}}{(optional) a vector of the marks attached to points located outside the sampling window.}
\item{\code{$marksout}}{(optional) a vector of the marks attached to points located outside the sampling window.}
}
}
\references{
\references{
Goreaud, F. and P?lissier, R. 1999. On explicit formula of edge effect correction for Ripley's \emph{K}-function. \emph{Journal of Vegetation Science}, 10:433-438.
Goreaud, F. and P?Pelissier, R. 1999. On explicit formula of edge effect correction for Ripley's \emph{K}-function. \emph{Journal of Vegetation Science}, 10:433-438.
}
}
\note{
\note{
There are printing, summary and plotting methods for \code{"spp"} objects.\cr
There are printing, summary and plotting methods for \code{"spp"} objects.\cr
@@ -51,11 +51,11 @@ A sampling window may be of simple or complex type. A simple sampling window may
...
@@ -51,11 +51,11 @@ A sampling window may be of simple or complex type. A simple sampling window may
with different arguments:
with different arguments:
\item{\code{$type}}{a vector of two character strings defining the type of sampling window among \code{c("simple","rectangle")}, \code{c("simple","circle")}, \code{c("complex","rectangle")} or \code{c("complex","circle")}.}
\item{\code{$type}}{a vector of two character strings defining the type of sampling window among \code{c("simple","rectangle")}, \code{c("simple","circle")}, \code{c("complex","rectangle")} or \code{c("complex","circle")}.}
\item{\code{$xmin,$ymin,$xmax,$ymax}}{(optional) coordinates of the origin and the opposite corner for a rectangular sampling window (see details).}
\item{\code{$xmin,$ymin,$xmax,$ymax}}{(optional) coordinates of the origin and the opposite corner for a rectangular sampling window (see details).}
\item{\code{$x0,$y0,$r0}}{(optional) coordinates of the center and radius for a circular sampling window (see details).}
\item{\code{$x0,$y0,$r0}}{(optional) coordinates of the centre and radius for a circular sampling window (see details).}
\item{\code{$triangles}}{(optional) vertices coordinates of triangles for a complex sampling window (see details).}
\item{\code{$triangles}}{(optional) vertices coordinates of triangles for a complex sampling window (see details).}
}
}
\references{
\references{
Goreaud, F. and P?lissier, R. 1999. On explicit formula of edge effect correction for Ripley's \emph{K}-function. \emph{Journal of Vegetation Science}, 10:433-438.
Goreaud, F. and P?Pelissier, R. 1999. On explicit formula of edge effect correction for Ripley's \emph{K}-function. \emph{Journal of Vegetation Science}, 10:433-438.
}
}
\note{
\note{
There are printing, summary and plotting methods for \code{"swin"} objects.\cr
There are printing, summary and plotting methods for \code{"swin"} objects.\cr
A list of 6 variables, suitable for using in \code{\link{swin}} and \code{\link{spp}}, and giving the vertices coordinates \eqn{(ax,ay,bx,by,cx,cy)} of the triangles that
A list of 6 variables, suitable for using in \code{\link{swin}} and \code{\link{spp}}, and giving the vertices coordinates \eqn{(ax,ay,bx,by,cx,cy)} of the triangles that
pave the polygon. For a polygon with \emph{t} holes totalling \eqn{n} vertices (outer contour + holes), the number of triangles produced
pave the polygon. For a polygon with \emph{t} holes totaling \eqn{n} vertices (outer contour + holes), the number of triangles produced
is \eqn{(n-2)+2t}, with \eqn{n<200} in this version of the program.
is \eqn{(n-2)+2t}, with \eqn{n<200} in this version of the program.
}
}
\references{
\references{
Goreaud, F. and P?lissier, R. 1999. On explicit formula of edge effect correction for Ripley's \emph{K}-function. \emph{Journal of Vegetation Science}, 10:433-438.\cr\cr
Goreaud, F. and P?Pelissier, R. 1999. On explicit formula of edge effect correction for Ripley's \emph{K}-function. \emph{Journal of Vegetation Science}, 10:433-438.\cr\cr
Narkhede, A. & Manocha, D. 1995. Fast polygon triangulation based on Seidel's algoritm. Pp 394-397 In A.W. Paeth (Ed.)
Narkhede, A. & Manocha, D. 1995. Fast polygon triangulation based on Seidel's algorithm. Pp 394-397 In A.W. Paeth (Ed.)