**cube_grid**,
a Python code which
generates a grid of points
over the interior of a cube (actually, a hexahedron) in 3D.

The grid is created inside a 3D shape which we may informally call a cube. Actually, it is a hexahedron (six-sided shape) determined by 8 user-specified vertices, given in a particular order that is suggested by the following list:

000 X00 0Y0 XY0 00Z X0Z 0YZ XYZ

For each dimension of the three spatial dimensions, the user may specify the number of subintervals into which the edges of the hexahedron are to be divided (at least 1, in each case). The total number of grid points may be determined by adding one to each of these three numbers and computing their product.

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

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

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 along a circle or circular arc in 2d.

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_grid, a python code which computes a grid of points over the interior of a 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.

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.

- cube_grid.py, the source code.
- cube_grid.sh, runs all the tests.
- cube_grid.txt, the output file.

- cube_grid_points.xyz, a sample set of grid points written to a file.
- cube_grid_points.png, a plot of a sample set of points.
- cube_grid_display.png, a demonstration of the output of cube_grid_display().