hypercube_grid

hypercube_grid, a Python code which generates a grid of points over the interior of a hypercube in M dimensions.

The M-dimensional hypercube is the set of points (X(1),X(2),...,X(M)) such that:

         A(I) <= X(I) <= B(I)
       

For each dimension I, a set of parameters is input:

• NS(I), the number of points along the I-th coordinate direction;
• A(I), B(I), the left and right endpoints of the I-th coordinate.
• C(I), one of 5 choices for centering the grid in the I-th coordinate.

The centering options allow the user to control the centering of the equally spaced points. This is easiest to illustrate if we look at a 1 dimensional case and assume A = 0 and B = 1. Then, using NS = 4, the centering options will produce 4 equally spaced points as follows:

• 1: 0, 1/3, 2/3, 1 (include endpoints)
• 2: 1/5, 2/5, 3/5, 4/5 (do not include endpoints)
• 3: 0, 1/4, 2/4, 3/4 (do not include right endpoint)
• 4: 1/4, 2/4, 3/4, 1 (do not include left endpoint)
• 5: 1/8, 3/8, 5/8, 7/8 (half spacing at the ends)

Licensing:

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

Languages:

hypercube_grid is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.

Related Data and Programs:

ball_grid, a python code which computes a grid of points over the interior of a ball in 3d.

circle_arc_grid, a python code which computes a grid of points over the length of a circular arc in 2d;

cube_grid, a python code which computes a grid of points over the interior of a cube in 3d.

disk_grid, a python code which computes a grid of points over the interior of a disk in 2d.

ellipse_grid, a python code which computes a grid of points over the interior of an ellipse in 2d.

ellipsoid_grid, a python code which computes grid points over the interior of an ellipsoid in 3d.

hypercube_monte_carlo, a python code which applies a monte carlo method to estimate the integral of a function over the interior of the unit hypercube in m dimensions;

line_grid, a python code which computes a grid of points over the interior of a line segment in 1d.

polygon_grid, a python code which generates a grid of points over the interior of a polygon in 2d.

pyramid_grid, a python code which computes a grid of points over the interior of the unit pyramid in 3d.

simplex_grid, a python code which generates a regular grid of points over the interior of an arbitrary simplex in m dimensions.

sphere_fibonacci_grid, a python code which uses a fibonacci spiral to create a grid of points on the surface of the unit sphere in 3d.

sphere_llq_grid, a python code which uses longitudes and latitudes to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3d.

sphere_llt_grid, a python code which uses longitudes and latitudes to create grids of points, lines, and triangles on the surface of the unit sphere in 3d.

square_grid, a python code which computes a grid of points over the interior of a square in 2d.

tetrahedron_grid, a python code which computes a grid of points over the interior of a tetrahedron in 3d.

triangle_grid, a python code which computes a grid of points over the interior of a triangle in 2d.

wedge_grid, a python code which computes a grid of points over the interior of the unit wedge in 3d.

Source Code:

• hypercube_grid.py, the source code.
• hypercube_grid.sh, runs all the tests.
• hypercube_grid.txt, the output file.

• hypercube_grid_points_test01.xyz, a sample set of grid points written to a file.
• hypercube_grid_points_test02.xyz, a sample set of grid points written to a file.
• hypercube_grid_points_test03.xyz, a sample set of grid points written to a file.