polygon_integrals, a Python code which returns the exact value of the integral of any monomial over the interior of a polygon in 2D.
We suppose that POLY is a planar polygon with N vertices X, Y, listed in counterclockwise order.
For nonnegative integers P and Q, the (unnormalized) moment of order (P,Q) for POLY is defined by:
Nu(P,Q) = Integral ( x, y in POLY ) x^p y^q dx dy
In particular, Nu(0,0) is the area of POLY.
Simple formulas are available for low orders:
Nu(0,0) = 1/2 (1<=i<=N) X(i-1)Y(i)-X(i)Y(i-1)
Nu(1,0) = 1/6 (1<=i<=N) ( X(i-1)Y(i)-X(i)Y(i-1) ) * (X(i-1)+X(i))
Nu(0,1) = 1/6 (1<=i<=N) ( X(i-1)Y(i)-X(i)Y(i-1) ) * (Y(i-1)+Y(i))
Nu(2,0) = 1/12 (1<=i<=N) ( X(i-1)Y(i)-X(i)Y(i-1) ) * (X(i-1)^2+X(i-1)X(i)+X(i)^2)
Nu(1,1) = 1/24 (1<=i<=N) ( X(i-1)Y(i)-X(i)Y(i-1) ) * (2X(i-1)Y(i-1)+X(i-1)Y(i)+X(i)Y(i-1)+2X(i)Y(i))
Nu(0,2) = 1/12 (1<=i<=N) ( X(i-1)Y(i)-X(i)Y(i-1) ) * (Y(i-1)^2+Y(i-1)Y(i)+Y(i)^2)
The normalized moment of order (P,Q) for POLY is defined by:
Alpha(P,Q) = Integral ( x, y in POLY ) x^p y^q dx dy / Area ( Poly )
= Nu(P,Q) / Nu(0,0)
In particular, Alpha(0,0) is 1.
The central moment of order (P,Q) for POLY is defined by:
x* = Alpha(1,0)
y* = Alpha(0,1)
Mu(P,Q) = Integral ( x, y in POLY ) (x-x*)^p (y-y*)^q dx dy / Area ( Poly )
Simple formulas are available for low orders:
Mu(0,0) = 1
Mu(1,0) = 0
Mu(0,1) = 0
Mu(2,0) = Alpha(2,0) - Alpha(1,0)^2
Mu(1,1) = Alpha(1,1) - Alpha(1,0) * Alpha(0,1)
Mu(0,2) = Alpha(0,2) - Alpha(0,1)^2
The computer code and data files described and made available on this web page are distributed under the MIT license
polygon_integrals is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.
ball_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit ball in 3d.
circle_integrals, a python code which returns the exact value of the integral of any monomial over the surface of the unit circle in 2d.
cube_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit cube in 3d.
disk01_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit disk in 2d.
hyperball_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit hyperball in m dimensions.
hypercube_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit hypercube in m dimensions.
hypersphere_integrals, a python code which returns the exact value of the integral of any monomial over the surface of the unit hypersphere in m dimensions.
line_integrals, a python code which returns the exact value of the integral of any monomial over the length of the unit line in 1d.
polygon_grid, a python code which generates a grid of points over the interior of a polygon in 2d.
polygon_monte_carlo, a python code which applies a monte carlo method to estimate the integral of a function over the interior of a polygon in 2d.
polygon_properties, a python 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.
polygon_triangulate, a python code which triangulates a possibly nonconvex polygon.
pyramid_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit pyramid in 3d.
simplex_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit simplex in m dimensions.
sphere_integrals, a python code which returns the exact value of the integral of any monomial over the surface of the unit sphere in 3d.
square_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit square in 2d.
tetrahedron_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit tetrahedron in 3d.
toms112, a python code which determines whether a point is contained in a polygon, by moshe shimrat. this is a version of acm toms algorithm 112.
triangle_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit triangle in 2d.
wedge_integrals, a python code which returns the exact value of the integral of any monomial over the interior of the unit wedge in 3d.