triangle_grid, a C code which generates a grid of points within the interior of a triangle in 2D.
Starting with any 3 points A, B, and C that define a triangle, we can divide each side of the triangle into N subintervals, and create a triangular grid. This defines ((N+1)*(N+2))/2 points that lie on the intersections of grid lines. The arrangement is suggested by this diagram:
X
9 X
8 9 X
7 8 9 X
6 7 8 9 X
5 6 7 8 9 X
4 5 6 7 8 9 X
3 4 5 6 7 8 9 X
2 3 4 5 6 7 8 9 X
1 2 3 4 5 6 7 8 9 X
0 1 2 3 4 5 6 7 8 9 X
The code includes a routine which allows the user to pick an arbitrary triangle and an arbitrary number of subdivisions. It then returns the triangular gridpoints defined by that choice.
The information on this web page is distributed under the MIT license.
triangle_grid is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
ball_grid, a C code which computes a grid of points over the interior of a ball in 3D.
cube_grid, a C code which computes a grid of points over the interior of a cube in 3D.
disk_grid, a C code which computes a grid of points over the interior of a disk in 2D.
ellipse_grid, a C code which computes a grid of points over the interior of an ellipse in 2D.
ellipsoid_grid, a C code which computes a grid of points over the interior of an ellipsoid in 3D.
hypercube_grid, a C code which computes a grid of points over the interior of a hypercube in M dimensions.
line_grid, a C code which computes a grid of points over the interior of a line segment in 1D.
polygon_grid, a C code which generates a grid of points over the interior of a polygon in 2D.
pyramid_grid, a C code which computes a grid of points over the interior of the unit pyramid in 3D;
simplex_grid, a C code which generates a regular grid of points over the interior of an arbitrary simplex in M dimensions.
sphere_fibonacci_grid, a C code which computes a grid of points using the Fibonacci spiral over the surface of a sphere in 3D.
sphere_grid, a C code which provides a number of ways of generating grids of points, or of points and lines, or of points and lines and faces, on the surface of the unit sphere in 3D.
sphere_llq_grid, a C 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 C 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 C code which computes a grid of points over the interior of a square in 2D.
tetrahedron_grid, a C code which computes a grid of points over the interior of a tetrahedron in 3D.
triangle_interpolate, a C code which shows how vertex data can be interpolated at any point in the interior of a triangle.
wedge_grid, a C code which computes a grid of points over the interior of the unit wedge in 3D.