LATIN_EDGE
Latin Edge Squares in M dimensions

LATIN_EDGE is a library of C++ routines, using double precision arithmetic, for making Latin Edge Squares.

A Latin square is a selection of one point from each row and column of a square matrix or table. In M dimensions, the corresponding item is a set of N points, where, in each dimension, there is exactly one point whose coordinates are in a given "column" or range of values. To emphasize the use of higher dimensions, these objects are sometimes called Latin hypersquares.

Once a Latin square has been selected, the center of each subsquare is chosen to yield a Latin Edge Square dataset. This is the same technique that yields a Latin Center Square dataset, with the difference that the mapping from the Latin Square to the unit square is shifted in such a way that the lowest and highest possible coordinate values are 0.0 and 1.0, instead of 1/(2*N) and (2*N-1)/(2*N).

Here is an image of a Latin edge grid with spatial dimension M = 2 and number of points N = 10.

Related Data and Programs:

CVT is a C++ library of routines for computing points in a Centroidal Voronoi Tessellation.

FAURE is a C++ library of routines for computing Faure sequences.

GRID is a C++ library of routines for computing points on a grid.

HALTON is a C++ library of routines for computing Halton sequences.

HAMMERSLEY is a C++ library of routines for computing Hammersley sequences.

HEX_GRID is a C++ library of routines for computing sets of points in a 2D hexagonal grid.

IHS is a C++ library of routines for computing improved Latin Hypercube datasets.

LATIN_CENTER is a C++ library of routines for computing Latin square data choosing the center value.

LATIN_EDGE is also available in a FORTRAN90 version and a MATLAB version.

LATIN_RANDOM is a C++ library of routines for computing Latin square data choosing a random value in the square.

NIEDERREITER2 is a C++ library of routines for computing Niederreiter sequences with base 2.

NORMAL is a C++ library which computes elements of a sequence of pseudorandom normally distributed values.

SOBOL is a C++ library of routines for computing Sobol sequences.

UNIFORM is a C++ library of routines for computing uniform random values.

VAN_DER_CORPUT is a C++ library of routines for computing van der Corput sequences.

Reference:

1. Paul Bratley, Bennett Fox, Linus Schrage,
   A Guide to Simulation,
   Springer Verlag, pages 201-202, 1983.
2. C J Colbourn, J H Dinitz,
   CRC Handbook of Combinatorial Design,
   CRC, 1996.
3. Bennett Fox,
   Algorithm 647:
   Implementation and Relative Efficiency of Quasirandom Sequence Generators,
   ACM Transactions on Mathematical Software,
   Volume 12, Number 4, pages 362-376, 1986.
4. M D McKay, W J Conover, R J Beckman,
   A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code,
   Technometrics,
   Volume 21, pages 239-245, 1979.
5. Albert Nijenhuis, Herbert Wilf,
   Combinatorial Algorithms,
   Academic Press, 1978, second edition,
   ISBN 0-12-519260-6.
6. Herbert Ryser,
   Combinatorial Mathematics,
   Mathematical Association of America, 1963.

Source Code:

• latin_edge.C, the source code.
• latin_edge.H, the include file.
• latin_edge.csh, commands to compile the source code.

Examples and Tests:

• latin_edge_prb.C, a sample calling program.
• latin_edge_prb.csh, commands to compile and run the sample program.
• latin_edge_prb.out, the output from a run of the sample program.

List of Routines:

• GET_SEED returns a random seed for the random number generator.
• I4_RANDOM returns a random integer in a given range.
• I4_SWAP switches two integer values.
• LATIN_EDGE returns edge points in a Latin square.
• PERM_RANDOM selects a random permutation of N objects.
• R8_UNIFORM_01 is a portable pseudorandom number generator.
• TIMESTAMP prints the current YMDHMS date as a time stamp.

You can go up one level to the C++ source codes.