polygon_minkowski, an Octave code which converts polygons between the vertex representation and the Minkowski representation, which uses a sequence of (non-unit) normal vectors.
Minkowski showed that any polygon (or higher dimensional polytope) can be represented by a set of normal vectors, such that vector v(i) has norm a(i), with the property that the sum v(i) = 0.
The information on this web page is distributed under the MIT license.
polygon_minkowski is available in a MATLAB version and an Octave version.
polygon, an Octave 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, counter clockwise ordering, diameter, distance to a point, inradius, lattice area, nearest point in set, outradius, uniform sampling, and triangulation.
polygon_average, an Octave code which demonstrates a process of repeatedly averaging and normalizing the vertices of a polygon, illustrating a property of the power method.
polygon_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from a polygon in 2D.
polygon_grid, an Octave code which generates a grid of points over the interior of a polygon in 2D.
polygon_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of a polygon in 2D.
polygon_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of a polygon in 2D.
polygon_triangulate, an Octave code which triangulates a (possibly nonconvex) polygon, based on a C function by Joseph Orourke.