KNOWPIA
WELCOME TO KNOWPIA

The **shoelace formula**, also known as **Gauss's area formula** and the **surveyor's formula**,^{[1]} is a mathematical algorithm to determine the area of a simple polygon whose vertices are described by their Cartesian coordinates in the plane.^{[2]} It is called the shoelace formula because of the constant cross-multiplying for the coordinates making up the polygon, like threading shoelaces.^{[2]} It has applications in surveying and forestry,^{[3]} among other areas.

The formula was described by Albrecht Ludwig Friedrich Meister (1724–1788) in 1769^{[4]} and is based on the trapezoid formula which was described by Carl Friedrich Gauss and C.G.J. Jacobi.^{[5]} The triangle form of the area formula can be considered to be a special case of Green's theorem.

The area formula can also be applied to self-overlapping polygons since the meaning of area is still clear even though self-overlapping polygons are not generally simple.^{[6]} Furthermore, a self-overlapping polygon can have multiple "interpretations" but the Shoelace formula can be used to show that the polygon's area is the same regardless of the interpretation.^{[7]}

*Given:* A planar simple polygon with a *positively oriented* (counter clock wise) sequence of points in a Cartesian coordinate system.

For the simplicity of the formulas below it is convenient to set .

*The formulas:*

The area of the given polygon can be expressed by a variety of formulas, which are connected by simple operations (see below):

If the polygon is *negatively oriented*, then the result of the formulas is negative. In any case is the sought area of the polygon.^{[8]}

The trapezoid formula sums up a sequence of oriented areas of trapezoids with as one of its four edges (see below):

The triangle formula sums up the oriented areas of triangles :^{[9]}

The triangle formula is the base of the popular *shoelace formula*, which is a scheme that optimizes the calculation of the sum of the 2×2-Determinants by hand:

Sometimes this determinant is transposed (written vertically, in two columns), as shown in the diagram.

A particularly concise statement of the formula can be given in terms of the exterior algebra. If are the consecutive vertices of the polygon (regarded as vectors in the Cartesian plane) then

For the area of the pentagon with one gets

The advantage of the shoelace form: Only 6 columns have to be written for calculating the 5 determinants with 10 columns.

The edge determines the trapezoid with its oriented area

In case of the number is negative, otherwise positive or if . In the diagram the orientation of an edge is shown by an arrow. The color shows the sign of : red means , green indicates . In the first case the trapezoid is called *negative* in the second case *positive*. The negative trapezoids delete those parts of positive trapezoids, which are outside the polygon. In case of a convex polygon (in the diagram the upper example) this is obvious: The polygon area is the sum of the areas of the positive trapezoids (green edges) minus the areas of the negative trapezoids (red edges). In the non convex case one has to consider the situation more
carefully (see diagram). In any case the result is

Eliminating the brackets and using
(see convention above), one gets the *determinant form* of the area formula:
Because one half of the i-th determinant is the oriented area of the triangle this version of the area formula is called *triangle form*.

With (see convention above) one gets Combining both sums and excluding leads to With the identity one gets

Alternatively, this is a special case of Green's theorem with one function set to 0 and the other set to x, such that the area is the integral of xdy along the boundary.

indicates the oriented area of the simple polygon with (see above). is positive/negative if the orientation of the polygon is positive/negative. From the triangle form of the area formula or the diagram below one observes for : In case of one should first shift the indices.

Hence:

- Moving affects only and leaves unchanged. There is no change of the area if is moved parallel to .
- Purging changes the total area by , which can be positive or negative.
- Inserting point between changes the total area by , which can be positive or negative.

**Example:**

With the above notation of the shoelace scheme one gets for the oriented area of the

*blue*polygon:*green*triangle:*red*triangle:- blue polygon
*minus*point : - blue polygon
*plus*point between :

One checks, that the following equations hold:

In higher dimensions the area of a polygon can be calculated from its vertices using the exterior algebra form of the Shoelace formula (e.g. in 3d, the sum of successive cross products): (when the vertices are not coplanar this computes the vector area enclosed by the loop, i.e. the projected area or "shadow" in the plane in which it is greatest).

This formulation can also be generalized to calculate the volume of an n-dimensional polytope from the coordinates of its vertices, or more accurately, from its hypersurface mesh.^{[10]} For example, the volume of a 3-dimensional polyhedron can be found by triangulating its surface mesh and summing the signed volumes of the tetrahedra formed by each surface triangle and the origin: where the sum is over the faces and care has to be taken to order the vertices consistently (all clockwise or anticlockwise viewed from outside the polyhedron). Alternatively, an expression in terms of the face areas and surface normals may be derived using the divergence theorem (see Polyhedron § Volume).

- Mathologer video about Gauss's shoelace formula

**^**Bart Braden (1986). "The Surveyor's Area Formula" (PDF).*The College Mathematics Journal*.**17**(4): 326–337. doi:10.2307/2686282. JSTOR 2686282. Archived from the original (PDF) on 29 June 2014.- ^
^{a}^{b}Dahlke, Karl. "Shoelace Formula". Retrieved 9 June 2008. **^**Hans Pretzsch,*Forest Dynamics, Growth and Yield: From Measurement to Model*, Springer, 2009, ISBN 3-540-88306-1, p. 232.**^**Meister, A. L. F. (1769), "Generalia de genesi figurarum planarum et inde pendentibus earum affectionibus",*Nov. Com. Gött.*(in Latin),**1**: 144.**^**Max Koecher, Aloys Krieg:*Ebene Geometrie*, Springer-Verlag, 2013, ISBN 3662068095, 9783662068090, p. 116**^**P.W. Shor; C.J. Van Wyk (1992), "Detecting and decomposing self-overlapping curves",*Comput. Geom. Theory Appl.*,**2**(1): 31–50, doi:10.1016/0925-7721(92)90019-O**^**Ralph P. Boland; Jorge Urrutia (2000).*Polygon Area Problems*. 12th Canadian Conference on Computational Geometry. pp. 159–162.**^**Antti Laaksonen:*Guide to Competitive Programming: Learning and Improving Algorithms Through Contests*, Springer, 2018, ISBN 3319725475, 9783319725475, p. 217**^**Mauren Abreu de Souza, Humberto Remigio Gamba, Helio Pedrini:*Multi-Modality Imaging: Applications and Computational Techniques*, Springer, 2018, ISBN 331998974X, 9783319989747, p. 229**^**Allgower, Eugene L.; Schmidt, Phillip H. (1986). "Computing Volumes of Polyhedra" (PDF).*Mathematics of Computation*.**46**(173): 171–174. doi:10.2307/2008221. ISSN 0025-5718. JSTOR 2008221.