polygon_grid, a Fortran90 code which generates a grid of points over the interior of a polygon in 2D.
The program relies on a simple idea in which the "vertex centroid" (average of the vertices) is computed, allowing the polygon to be triangulated. Each triangle can then easily be gridded. The collection of triangular grids joins up to form a grid over the polygon, although the spacing of the the grid points will vary from triangle to triangle.
The program really only works properly for convex polygons. If the polygon is not convex, then the vertex centroid need not lie inside the polygon, consequently the grid points may also seem misaligned.
The information on this web page is distributed under the MIT license.
polygon_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 Fortran90 code which computes a grid of points over the interior of a ball in 3D.
circle_arc_grid, a Fortran90 code which computes points equally spaced along a circular arc;
cube_grid, a Fortran90 code which computes a grid of points over the interior of a cube in 3D.
disk_grid, a Fortran90 code which computes a grid of points over the interior of a disk in 2D.
ellipse_grid, a Fortran90 code which computes a grid of points over the interior of an ellipse in 2D.
ellipsoid_grid, a Fortran90 code which computes a grid of points over the interior of an ellipsoid in 3D.
hypercube_grid, a Fortran90 code which computes a grid of points over the interior of a hypercube in M dimensions.
line_grid, a Fortran90 code which computes a grid of points over the interior of a line segment in 1D.
polygon, a Fortran90 code which computes properties of an arbitrary polygon in the plane, defined by a sequence of vertices, including interior angles, area, centroid, containment of a point, convexity, diameter, distance to a point, inradius, lattice area, nearest point in set, outradius, uniform sampling, and triangulation.
pyramid_grid, a Fortran90 code which computes a grid of points over the interior of the unit pyramid in 3D;
simplex_grid, a Fortran90 code which generates a grid of points over the interior of a simplex in M dimensions.
sphere_cubed_grid, a Fortran90 code which uses the projection of a cube to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3D.
sphere_fibonacci_grid, a Fortran90 code which uses a Fibonacci spiral to create a grid of points on the surface of the unit sphere in 3D.
sphere_grid, a Fortran90 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 Fortran90 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 Fortran90 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 Fortran90 code which computes a grid of points over the interior of a square in 2D.
tetrahedron_grid, a Fortran90 code which computes a grid of points over the interior of a tetrahedron in 3D.
triangle_grid, a Fortran90 code which computes a grid of points over the interior of a triangle in 2D.
wedge_grid, a Fortran90 code which computes a grid of points over the interior of the unit wedge in 3D.