HEX_GRID
Routines for a Hexagonal Grid


HEX_GRID is a C++ library which computes points on a hexagonal grid.

For one set of routines, the hexagonal grid is defined in the unit square [0,1] x [0,1]. For a matching set of routines, the hexagonal grid is defined on a coordinate box [A,B] x [C,D].

All nodes of the grid lie on one of LAYERS horizontal lines. The first of these lines is the X axis (for grids in the unit square) or the line from (A,C) to (B,C), for grids in a coordinate box. Each successive line is HY units higher.

On all the odd numbered lines, there are NODES_PER_LAYER points, equally spaced from 0 to 1 or A to B, with a spacing of HX.

On the even numbered lines, there are NODES_PER_LAYER-1 points, whose values are the midpoints of successive intervals on an odd numbered line. (The grid is staggered).

In order to maintain the hexagonal structure, the following relationship is required between HX and HY:

        HY = HX * sqrt ( 3 ) / 2.
      

Here is an image of a hexagonal grid with NODES_PER_ROW = 21 and LAYERS = 24, and a total of N = 492 nodes.

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Related Data and Programs:

CVT is a C++ library which computes elements of a Centroidal Voronoi Tessellation.

FAURE is a C++ library which computes Faure sequences.

GRID is a C++ library which computes elements of a grid sequence.

HALTON is a C++ library which computes Halton sequences.

HAMMERSLEY is a C++ library which computes Hammersley sequences.

HEX_GRID is available in a C++ version and a FORTRAN90 version and a MATLAB version.

HEX_GRID is a dataset collection which contains examples of hexagonal grids.

HEX_GRID_ANGLE is a FORTRAN90 library which computes elements of an angled hexagonal grid dataset.

HEX_GRID_DATASET is a C++ program which can create a hex grid dataset and write it to a file.

HEX_GRID_TRIANGULATE is a FORTRAN90 program which uses the HEX_GRID library and finds points on a hex grid that lie within a given arbitrary region.

IHS is a C++ library which computes elements of an improved distributed Latin hypercube dataset.

LATIN_CENTER is a C++ library which computes elements of a Latin Hypercube dataset, choosing center points.

LATIN_EDGE is a C++ library which computes elements of a Latin Hypercube dataset, choosing edge points.

LATIN_RANDOM is a C++ library which computes elements of a Latin Hypercube dataset, choosing points at random.

LCVT is a C++ library which computes a latinized Centroidal Voronoi Tessellation.

NIEDERREITER2 is a C++ library which computes elements of a Niederreiter quasirandom sequence using base 2.

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

SOBOL is a C++ library which computes Sobol sequences.

TOMS647 is a FORTRAN77 library which is a version of ACM TOMS algorithm 647, for evaluating Faure, Halton and Sobol quasirandom sequences.

UNIFORM is a C++ library which computes elements of a uniform pseudorandom sequence.

VAN_DER_CORPUT is a C++ library which computes elements of a 1D van der Corput sequence.

Source Code:

Examples and Tests:

List of Routines:

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


Last revised on 11 November 2006.