The R Project SVN R

Rev

Rev 85953 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 85953 Rev 90060
Line 22... Line 22...
22 
    varying \code{asp} around 1, for \code{nr.plots <= 12}.}
 22 
    varying \code{asp} around 1, for \code{nr.plots <= 12}.}
23 
}
 23 
}
24 
\value{
 24 
\value{
25 
  A length-two integer vector \code{(nr, nc)} giving the positive number of rows
 25 
  A length-two integer vector \code{(nr, nc)} giving the positive number of rows
26 
  and columns, fulfilling \code{nr * nc >= nr.plots}, and currently, for
 26 
  and columns, fulfilling \code{nr * nc >= nr.plots}, and currently, for
27 
  \code{asp = 1}, \code{nr >= nc >= 1}.
 27 
  \code{asp = 1}, \code{nr >= nc} and \code{nr >= 1}.
28 
}
 28 
}
29 
\note{
 29 
\note{
30 
  Conceptually, this is a quadratic integer optimization problem, with
 30 
  Conceptually, this is a quadratic integer optimization problem, with
31 
  inequality constraints \eqn{nr >= 1}, \eqn{nc >= 1}, and
 31 
  inequality constraints \eqn{nr >= 1}, \eqn{nc >= 1}, and
32 
  \eqn{nr.plots >= nr*nc} (and possibly \code{nr >= asp*nc}),
 32 
  \eqn{nr.plots >= nr*nc} (and possibly \code{nr >= asp*nc}),