polygon_grid, a C++ 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.
cpp_grid, a C++ code which generates a regular grid of points inside a variety of regions in one, two, three or many dimensions.
polygon, a C++ 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.