![]() |
VOOZH | about |
Given ordered coordinates of a polygon with n vertices. Find the area of the polygon. Here ordered means that the coordinates are given either in a clockwise manner or anticlockwise from the first vertex to last.
Examples :
Input : X[] = {0, 4, 4, 0}, Y[] = {0, 0, 4, 4};
Output : 16
Input : X[] = {0, 4, 2}, Y[] = {0, 0, 4}
Output : 8
We can compute the area of a polygon using the Shoelace formula.
Area
= | 1/2 [ (x1y2 + x2y3 + ... + xn-1yn + xny1) -
(x2y1 + x3y2 + ... + xnyn-1 + x1yn) ] |
The above formula is derived by following the cross product of the vertices to get the Area of triangles formed in the polygon.
Below is an implementation of the above formula.
Output :
2
Time Complexity: O(n)
Auxiliary Space: O(1), since no extra space has been taken.
Why is it called Shoelace Formula?
The formula is called so because of the way we evaluate it.
Example :
Let the input vertices be (0, 1), (2, 3), and (4, 7). Evaluation procedure matches with process of tying shoelaces. We write vertices as below 0 1 2 3 4 7 0 1 [written twice] we evaluate positive terms as below 0 \ 1 2 \ 3 4 \ 7 0 1 i.e., 0*3 + 2*7 + 4*1 = 18 we evaluate negative terms as below 0 1 2 / 3 4 / 7 0 / 1 i.e., 0*7 + 4*3 + 2*1 = 14 Area = 1/2 (18 - 14) = 2 See this for a clearer image.
How does this work?
We can always divide a polygon into triangles. The area formula is derived by taking each edge AB and calculating the (signed) area of triangle ABO with a vertex at the origin O, by taking the cross-product (which gives the area of a parallelogram) and dividing by 2. As one wraps around the polygon, these triangles with positive and negative areas will overlap, and the areas between the origin and the polygon will be canceled out and sum to 0, while only the area inside the reference triangle remains. [Source: Wiki]
For a better understanding look at the following diagrams:
Related articles :
Minimum Cost Polygon Triangulation
Find Simple Closed Path for a given set of points