1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72
|
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Library General Public
# License as published by the Free Software Foundation; either
# version 2 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU Library General Public License for more details.
#
# You should have received a copy of the GNU Library General
# Public License along with this library; if not, write to the
# Free Foundation, Inc., 59 Temple Place, Suite 330, Boston,
# MA 02111-1307 USA
################################################################################
# FUNCTION: DESCRIPTION:
# gridVector Creates from two vectors rectangular grid coordinates
################################################################################
gridVector <-
function(x, y = NULL)
{
# A function implemented by Diethelm Wuertz
# Description:
# Creates from two vectors rectangular grid coordinates
# Arguments:
# x, y - two numeric vectors of length m and n which span the
# rectangular grid of size m times n.
# Details:
# The two vectors x and y span a rectangular grid with nx=length(x)
# times ny=length(y) points which are returned as a matrix of size
# (nx*ny) times 2.
# Value:
# returns a list with two elements X and Y each of length m
# times n
# Example:
# > gridVector(1:3, 1:2)
# [,1] [,2]
# [1,] 1 1
# [2,] 2 1
# [3,] 3 1
# [4,] 1 2
# [5,] 2 2
# [6,] 3 2
# FUNCTION:
# DW:
if (is.null(y)) y = x
# Prepare for Input:
nx = length(x)
ny = length(y)
xoy = cbind(rep(x, ny), as.vector(matrix(y, nx, ny, byrow = TRUE)))
X = matrix(xoy, nx * ny, 2, byrow = FALSE)
# Return Value:
list(X = X[,1], Y = X[,2])
}
################################################################################
|