**line_grid**,
a Python code which
generates a grid of points
over the interior of a line segment in 1D.

The 1D line segment is the set of points X such that:

A <= X <= B

A set of parameters is specified:

- N, the number of points;
- A, B, the left and right endpoints;
- C, one of 5 choices for centering the grid;

The centering options allow the user to control the centering of the equally spaced points. Assume A = 0 and B = 1. Then, using N = 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)

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

**line_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 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_grid, a python code which computes grid points over the interior of a hypercube in m dimensions.

line_monte_carlo, a python code which applies a monte carlo method to estimate the integral of a function over the length of the unit 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 grid of points over the interior of a 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.

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