Determining the convexity of a polygon.

The Kyrus-Back algorithm assumes a convex polygon to be used as a window.

However, in practice, the problem of cutting off by a polygon quite often arises, and information about whether it is convex or not is not initially specified. In this case, before starting the clipping procedure, it is necessary to determine whether the given polygon is convex or not.

Let us give some definitions of the convexity of a polygon

A polygon is considered convex if one of the following conditions is met:

1) in a convex polygon, all vertices are located on one side of the line carrying any edge (on the inside of the given edge);

2) all interior angles of the polygon are less than 180 o;

3) all diagonals connecting the vertices of a polygon lie inside this polygon;

4) all corners of the polygon are bypassed in the same direction (Fig. 3.3‑1).

To develop an analytical representation of the last convexity criterion, we use the vector product.

vector product W two vectors a and b (Fig. 3.3-2 a) defined as:

A x ,a y ,a z and b x ,b y ,b z a and b,

- i, j, k– unit vectors along the coordinate axes X , Y , Z .

Rice.3.3 ‑ 1

Rice.3.3 ‑ 2

If we consider the two-dimensional representation of the polygon as its representation in the XY coordinate plane of the three-dimensional coordinate system X ,Y ,Z (Fig. 3.3‑2 b ), then the expression for the formation of the cross product of vectors U and V, where the vectors U and V are adjacent edges that form the corner of the polygon, can be written as a determinant:

The cross product vector is perpendicular to the plane in which the factor vectors are located. The direction of the product vector is determined by the gimlet rule or by the rule of a right-handed screw.

For the case shown in Fig. 3.3‑2 b ), vector W, corresponding to the vector product of vectors V, U, will have the same directivity as the direction of the Z coordinate axis.

Taking into account the fact that the projections on the Z axis of vectors-factors in this case are equal to zero, the vector product can be represented as:

(3.3-1)

Unit vector k always positive, hence the sign of the vector w vector product will be determined only by the sign of the determinant D in the above expression. Note that, based on the property of the vector product, when rearranging the factor vectors U and V vector sign w will change to the opposite.

It follows from this that if as vectors V and U consider two adjacent edges of the polygon, then the order of enumeration of vectors in the vector product can be put in accordance with the bypass of the considered corner of the polygon or the edges forming this corner. This allows us to use the rule as a criterion for determining the convexity of a polygon:

if for all pairs of edges of the polygon the following condition is satisfied:

If the signs of vector products for individual angles do not match, then the polygon is not convex.

Since the edges of a polygon are specified as the coordinates of their end points, it is more convenient to use the determinant to determine the sign of a cross product.

broken line

Definition

broken line, or shorter, broken line, is called a finite sequence of segments, such that one of the ends of the first segment serves as the end of the second, the other end of the second segment serves as the end of the third, and so on. In this case, adjacent segments do not lie on the same straight line. These segments are called polyline links.

Types of broken line

The broken line is called closed if the beginning of the first segment coincides with the end of the last one.

The broken line can cross itself, touch itself, lean on itself. If there are no such singularities, then such a broken line is called simple.

Polygons

Definition

A simple closed polyline, together with a part of the plane bounded by it, is called polygon.

Comment

At each vertex of a polygon, its sides define some angle of the polygon. It can be either less than deployed, or more than deployed.

Property

Each polygon has an angle less than $180^\circ$.

Proof

Let a polygon $P$ be given.

Let's draw some straight line that does not intersect it. We will move it parallel to the side of the polygon. At some point, for the first time we obtain a line $a$ that has at least one common point with the polygon $P$. The polygon lies on one side of this line (moreover, some of its points lie on the line $a$).

The line $a$ contains at least one vertex of the polygon. Its two sides converge in it, located on the same side of the line $a$ (including the case when one of them lies on this line). So, at this vertex, the angle is less than the developed one.

Definition

The polygon is called convex if it lies on one side of each line containing its side. If the polygon is not convex, it is called non-convex.

Comment

A convex polygon is the intersection of half-planes bounded by lines that contain the sides of the polygon.

Properties of a convex polygon

A convex polygon has all angles less than $180^\circ$.

A line segment connecting any two points of a convex polygon (in particular, any of its diagonals) is contained in this polygon.

Proof

Let's prove the first property

Take any corner $A$ of a convex polygon $P$ and its side $a$ coming from the vertex $A$. Let $l$ be a line containing side $a$. Since the polygon $P$ is convex, it lies on one side of the line $l$. Therefore, its angle $A$ also lies on the same side of this line. Hence the angle $A$ is less than the straightened angle, that is, less than $180^\circ$.

Let's prove the second property

Take any two points $A$ and $B$ of a convex polygon $P$. The polygon $P$ is the intersection of several half-planes. The segment $AB$ is contained in each of these half-planes. Therefore, it is also contained in the polygon $P$.

Definition

Diagonal polygon is called a segment connecting its non-neighboring vertices.

Theorem (on the number of diagonals of an n-gon)

The number of diagonals of a convex $n$-gon is calculated by the formula $\dfrac(n(n-3))(2)$.

Proof

From each vertex of an n-gon one can draw $n-3$ diagonals (one cannot draw a diagonal to neighboring vertices and to this vertex itself). If we count all such possible segments, then there will be $n\cdot(n-3)$, since there are $n$ vertices. But each diagonal will be counted twice. Thus, the number of diagonals of an n-gon is $\dfrac(n(n-3))(2)$.

Theorem (on the sum of the angles of an n-gon)

The sum of the angles of a convex $n$-gon is $180^\circ(n-2)$.

Proof

Consider an $n$-gon $A_1A_2A_3\ldots A_n$.

Take an arbitrary point $O$ inside this polygon.

The sum of the angles of all triangles $A_1OA_2$, $A_2OA_3$, $A_3OA_4$, \ldots, $A_(n-1)OA_n$ is $180^\circ\cdot n$.

On the other hand, this sum is the sum of all interior angles of the polygon and the total angle $\angle O=\angle 1+\angle 2+\angle 3+\ldots=30^\circ$.

Then the sum of the angles of the considered $n$-gon is equal to $180^\circ\cdot n-360^\circ=180^\circ\cdot(n-2)$.

Consequence

The sum of the angles of a non-convex $n$-gon is $180^\circ(n-2)$.

Proof

Consider a polygon $A_1A_2\ldots A_n$ whose only angle $\angle A_2$ is non-convex, that is, $\angle A_2>180^\circ$.

Let's denote the sum of his catch $S$.

Connect the points $A_1A_3$ and consider the polygon $A_1A_3\ldots A_n$.

The sum of the angles of this polygon is:

$180^\circ\cdot(n-1-2)=S-\angle A_2+\angle 1+\angle 2=S-\angle A_2+180^\circ-\angle A_1A_2A_3=S+180^\circ-( \angle A_1A_2A_3+\angle A_2)=S+180^\circ-360^\circ$.

Therefore, $S=180^\circ\cdot(n-1-2)+180^\circ=180^\circ\cdot(n-2)$.

If the original polygon has more than one non-convex corner, then the operation described above can be done with each such corner, which will lead to the assertion being proved.

Theorem (on the sum of the exterior angles of a convex n-gon)

The sum of the exterior angles of a convex $n$-gon is $360^\circ$.

Proof

The exterior angle at vertex $A_1$ is $180^\circ-\angle A_1$.

The sum of all external angles is:

$\sum\limits_(n)(180^\circ-\angle A_n)=n\cdot180^\circ - \sum\limits_(n)A_n=n\cdot180^\circ - 180^\circ\cdot(n -2)=360^\circ$.

In this lesson, we will start a new topic and introduce a new concept for us - a "polygon". We will look at the basic concepts associated with polygons: sides, vertices, corners, convexity and non-convexity. Then we will prove the most important facts, such as the theorem on the sum of the interior angles of a polygon, the theorem on the sum of the exterior angles of a polygon. As a result, we will come close to studying special cases of polygons, which will be considered in future lessons.

Theme: Quadrangles

Lesson: Polygons

In the course of geometry, we study the properties of geometric shapes and have already considered the simplest of them: triangles and circles. At the same time, we also discussed specific special cases of these figures, such as right-angled, isosceles and regular triangles. Now it's time to talk about more general and complex shapes - polygons.

With a special case polygons we are already familiar - this is a triangle (see Fig. 1).

Rice. 1. Triangle

The name itself already emphasizes that this is a figure that has three corners. Therefore, in polygon there can be many of them, i.e. more than three. For example, let's draw a pentagon (see Fig. 2), i.e. figure with five corners.

Rice. 2. Pentagon. Convex polygon

Definition.Polygon- a figure consisting of several points (more than two) and the corresponding number of segments that connect them in series. These points are called peaks polygon, and segments - parties. In this case, no two adjacent sides lie on the same straight line and no two non-adjacent sides intersect.

Definition.regular polygon is a convex polygon in which all sides and angles are equal.

Any polygon divides the plane into two regions: internal and external. The interior is also referred to as polygon.

In other words, for example, when they talk about a pentagon, they mean both its entire inner region and its border. And the inner area also includes all points that lie inside the polygon, i.e. the point also belongs to the pentagon (see Fig. 2).

Polygons are sometimes also called n-gons to emphasize that the general case of having some unknown number of corners (n pieces) is being considered.

Definition. Polygon Perimeter is the sum of the lengths of the sides of the polygon.

Now we need to get acquainted with the types of polygons. They are divided into convex and non-convex. For example, the polygon shown in Fig. 2 is convex, and in Fig. 3 non-convex.

Rice. 3. Non-convex polygon

Definition 1. Polygon called convex, if when drawing a straight line through any of its sides, the entire polygon lies only on one side of this line. non-convex are all the rest polygons.

It is easy to imagine that when extending any side of the pentagon in Fig. 2 it will all be on one side of this straight line, i.e. he is convex. But when drawing a straight line through the quadrilateral in Fig. 3 we already see that it divides it into two parts, i.e. he is non-convex.

But there is another definition of the convexity of a polygon.

Definition 2. Polygon called convex if, when choosing any two of its interior points and connecting them with a segment, all points of the segment are also interior points of the polygon.

A demonstration of the use of this definition can be seen in the example of constructing segments in Fig. 2 and 3.

Definition. Diagonal A polygon is any segment that connects two non-adjacent vertices.

To describe the properties of polygons, there are two most important theorems about their angles: convex polygon interior angle sum theorem and convex polygon exterior angle sum theorem. Let's consider them.

Theorem. On the sum of interior angles of a convex polygon (n-gon).

Where is the number of its angles (sides).

Proof 1. Let's depict in Fig. 4 convex n-gon.

Rice. 4. Convex n-gon

Draw all possible diagonals from the vertex. They divide the n-gon into triangles, because each of the sides of the polygon forms a triangle, except for the sides adjacent to the vertex. It is easy to see from the figure that the sum of the angles of all these triangles will just be equal to the sum of the interior angles of the n-gon. Since the sum of the angles of any triangle is , then the sum of the interior angles of an n-gon is:

Q.E.D.

Proof 2. Another proof of this theorem is also possible. Let's draw a similar n-gon in Fig. 5 and connect any of its interior points to all vertices.

Rice. 5.

We got a partition of an n-gon into n triangles (how many sides, so many triangles). The sum of all their angles is equal to the sum of the interior angles of the polygon and the sum of the angles at the interior point, and this is the angle. We have:

Q.E.D.

Proven.

According to the proved theorem, it can be seen that the sum of the angles of an n-gon depends on the number of its sides (on n). For example, in a triangle, and the sum of the angles is . In a quadrilateral, and the sum of the angles - etc.

Theorem. On the sum of exterior angles of a convex polygon (n-gon).

Where is the number of its corners (sides), and , ..., are external corners.

Proof. Let's draw a convex n-gon in Fig. 6 and denote its internal and external angles.

Rice. 6. Convex n-gon with marked exterior corners

Because the outer corner is connected to the inner one as adjacent, then and similarly for other external corners. Then:

During the transformations, we used the already proven theorem on the sum of the interior angles of an n-gon.

Proven.

From the proved theorem follows an interesting fact that the sum of the external angles of a convex n-gon is equal to on the number of its angles (sides). By the way, unlike the sum of interior angles.

Bibliography

1. Aleksandrov A.D. etc. Geometry, grade 8. - M.: Education, 2006.
2. Butuzov V.F., Kadomtsev S.B., Prasolov V.V. Geometry, 8th grade. - M.: Education, 2011.
3. Merzlyak A.G., Polonsky V.B., Yakir S.M. Geometry, 8th grade. - M.: VENTANA-GRAF, 2009.

1. Profmeter.com.ua ().
2. Narod.ru ().
3. Xvatit.com().

Homework

These geometric shapes surround us everywhere. Convex polygons are natural, such as honeycombs, or artificial (man-made). These figures are used in the production of various types of coatings, in painting, architecture, decorations, etc. Convex polygons have the property that all their points are on the same side of a straight line that passes through a pair of adjacent vertices of this geometric figure. There are other definitions as well. A polygon is called convex if it is located in a single half-plane with respect to any straight line containing one of its sides.

In the course of elementary geometry, only simple polygons are always considered. To understand all the properties of such, it is necessary to understand their nature. To begin with, it should be understood that any line is called closed, the ends of which coincide. Moreover, the figure formed by it can have a variety of configurations. A polygon is a simple closed broken line, in which neighboring links are not located on the same straight line. Its links and vertices are, respectively, the sides and vertices of this geometric figure. A simple polyline must not have self-intersections.

The vertices of a polygon are called adjacent if they represent the ends of one of its sides. A geometric figure that has the nth number of vertices, and hence the nth number of sides, is called an n-gon. The broken line itself is called the border or contour of this geometric figure. A polygonal plane or a flat polygon is called the end part of any plane bounded by it. The adjacent sides of this geometric figure are called segments of a broken line emanating from one vertex. They will not be adjacent if they come from different vertices of the polygon.

Other definitions of convex polygons

In elementary geometry, there are several more equivalent definitions indicating which polygon is called convex. All of these statements are equally true. A convex polygon is one that has:

Every line segment that connects any two points within it lies entirely within it;

All its diagonals lie inside it;

Any internal angle does not exceed 180°.

A polygon always splits a plane into 2 parts. One of them is limited (it can be enclosed in a circle), and the other is unlimited. The first is called the inner region, and the second is the outer region of this geometric figure. This polygon is an intersection (in other words, a common component) of several half-planes. Moreover, each segment that has ends at points that belong to the polygon completely belongs to it.

Varieties of convex polygons

The definition of a convex polygon does not indicate that there are many kinds of them. And each of them has certain criteria. So, convex polygons that have an interior angle of 180° are called weakly convex. A convex geometric figure that has three vertices is called a triangle, four - a quadrangle, five - a pentagon, etc. Each of the convex n-gons meets the following essential requirement: n must be equal to or greater than 3. Each of the triangles is convex. A geometric figure of this type, in which all vertices are located on the same circle, is called inscribed in a circle. A convex polygon is called circumscribed if all its sides near the circle touch it. Two polygons are said to be equal only if they can be superimposed by superposition. A flat polygon is a polygonal plane (part of a plane), which is limited by this geometric figure.

Regular convex polygons

Regular polygons are geometric shapes with equal angles and sides. Inside them there is a point 0, which is at the same distance from each of its vertices. It is called the center of this geometric figure. The segments connecting the center with the vertices of this geometric figure are called apothems, and those that connect the point 0 with the sides are called radii.

A regular quadrilateral is a square. An equilateral triangle is called an equilateral triangle. For such figures, there is the following rule: each angle of a convex polygon is 180° * (n-2)/ n,

where n is the number of vertices of this convex geometric figure.

The area of ​​any regular polygon is determined by the formula:

where p is equal to half the sum of all sides of the given polygon, and h is equal to the length of the apothem.

Properties of convex polygons

Convex polygons have certain properties. So, a segment that connects any 2 points of such a geometric figure is necessarily located in it. Proof:

Suppose P is a given convex polygon. We take 2 arbitrary points, for example, A, B, which belong to P. According to the existing definition of a convex polygon, these points are located on the same side of the line, which contains any side of P. Therefore, AB also has this property and is contained in P. A convex polygon is always it is possible to break it into several triangles by absolutely all the diagonals that are drawn from one of its vertices.

Angles of convex geometric shapes

The corners of a convex polygon are the corners that are formed by its sides. Internal corners are located in the inner region of a given geometric figure. The angle that is formed by its sides that converge at one vertex is called the angle of a convex polygon. with internal angles of a given geometric figure are called external. Each corner of a convex polygon located inside it is equal to:

where x is the value of the external angle. This simple formula applies to any geometric shapes of this type.

In general, for exterior angles, there is the following rule: each angle of a convex polygon is equal to the difference between 180° and the value of the interior angle. It can have values ​​ranging from -180° to 180°. Therefore, when the inside angle is 120°, the outside angle will be 60°.

Sum of angles of convex polygons

The sum of the interior angles of a convex polygon is determined by the formula:

where n is the number of vertices of the n-gon.

The sum of the angles of a convex polygon is quite easy to calculate. Consider any such geometric figure. To determine the sum of angles inside a convex polygon, one of its vertices must be connected to other vertices. As a result of this action, (n-2) triangles are obtained. We know that the sum of the angles of any triangle is always 180°. Since their number in any polygon is (n-2), the sum of the interior angles of such a figure is 180° x (n-2).

The sum of the angles of a convex polygon, namely any two internal and adjacent external angles, for a given convex geometric figure will always be 180°. Based on this, you can determine the sum of all its angles:

The sum of the interior angles is 180° * (n-2). Based on this, the sum of all external angles of a given figure is determined by the formula:

180° * n-180°-(n-2)= 360°.

The sum of the exterior angles of any convex polygon will always be 360° (regardless of the number of sides).

The exterior angle of a convex polygon is generally represented by the difference between 180° and the interior angle.

Other properties of a convex polygon

In addition to the basic properties of these geometric shapes, they have others that arise when manipulating them. So, any of the polygons can be divided into several convex n-gons. To do this, it is necessary to continue each of its sides and cut this geometric figure along these straight lines. It is also possible to split any polygon into several convex parts in such a way that the vertices of each of the pieces coincide with all its vertices. From such a geometric figure, triangles can be very simply made by drawing all the diagonals from one vertex. Thus, any polygon, ultimately, can be divided into a certain number of triangles, which turns out to be very useful in solving various problems associated with such geometric shapes.

Perimeter of a convex polygon

The segments of a broken line, called the sides of a polygon, are most often indicated by the following letters: ab, bc, cd, de, ea. These are the sides of a geometric figure with vertices a, b, c, d, e. The sum of the lengths of all sides of this convex polygon is called its perimeter.

Polygon circle

Convex polygons can be inscribed and circumscribed. A circle that touches all sides of this geometric figure is called inscribed in it. Such a polygon is called circumscribed. The center of a circle that is inscribed in a polygon is the intersection point of the bisectors of all angles within a given geometric figure. The area of ​​such a polygon is:

where r is the radius of the inscribed circle and p is the semi-perimeter of the given polygon.

A circle containing the vertices of a polygon is called circumscribed around it. Moreover, this convex geometric figure is called inscribed. The center of the circle, which is circumscribed about such a polygon, is the intersection point of the so-called perpendicular bisectors of all sides.

Diagonals of convex geometric shapes

The diagonals of a convex polygon are line segments that connect non-adjacent vertices. Each of them lies inside this geometric figure. The number of diagonals of such an n-gon is determined by the formula:

N = n (n - 3) / 2.

The number of diagonals of a convex polygon plays an important role in elementary geometry. The number of triangles (K) into which each convex polygon can be divided is calculated by the following formula:

The number of diagonals of a convex polygon always depends on the number of its vertices.

Splitting a convex polygon

In some cases, to solve geometric problems, it is necessary to split a convex polygon into several triangles with non-intersecting diagonals. This problem can be solved by deriving a certain formula.

Definition of the problem: let's call a correct partition of a convex n-gon into several triangles by diagonals that intersect only at the vertices of this geometric figure.

Solution: Suppose that Р1, Р2, Р3 …, Pn are vertices of this n-gon. The number Xn is the number of its partitions. Let us carefully consider the resulting diagonal of the geometric figure Pi Pn. In any of the regular partitions P1 Pn belongs to a certain triangle P1 Pi Pn, which has 1

Let i = 2 be one group of regular partitions always containing the diagonal Р2 Pn. The number of partitions included in it coincides with the number of partitions of the (n-1)-gon Р2 Р3 Р4… Pn. In other words, it equals Xn-1.

If i = 3, then this other group of partitions will always contain the diagonals P3 P1 and P3 Pn. In this case, the number of regular partitions contained in this group will coincide with the number of partitions of the (n-2)-gon Р3 Р4… Pn. In other words, it will equal Xn-2.

Let i = 4, then among the triangles a regular partition will certainly contain a triangle P1 P4 Pn, to which the quadrangle P1 P2 P3 P4, (n-3)-gon P4 P5 ... Pn will adjoin. The number of regular partitions of such a quadrilateral is X4, and the number of partitions of an (n-3)-gon is Xn-3. Based on the foregoing, we can say that the total number of correct partitions contained in this group is Xn-3 X4. Other groups for which i = 4, 5, 6, 7… will contain Xn-4 X5, Xn-5 X6, Xn-6 X7 … regular partitions.

Let i = n-2, then the number of correct partitions in this group will match the number of partitions in the group where i=2 (in other words, equals Xn-1).

Since X1 = X2 = 0, X3=1, X4=2…, then the number of all partitions of a convex polygon is equal to:

Xn = Xn-1 + Xn-2 + Xn-3 X4 + Xn-4 X5 + ... + X 5 Xn-4 + X4 Xn-3 + Xn-2 + Xn-1.

X5 = X4 + X3 + X4 = 5

X6 = X5 + X4 + X4 + X5 = 14

X7 = X6 + X5 + X4 * X4 + X5 + X6 = 42

X8 = X7 + X6 + X5 * X4 + X4 * X5 + X6 + X7 = 132

The number of regular partitions intersecting one diagonal inside

When checking special cases, one can come to the assumption that the number of diagonals of convex n-gons is equal to the product of all partitions of this figure by (n-3).

Proof of this assumption: imagine that P1n = Xn * (n-3), then any n-gon can be divided into (n-2)-triangles. Moreover, an (n-3)-quadrilateral can be composed of them. Along with this, each quadrilateral will have a diagonal. Since two diagonals can be drawn in this convex geometric figure, this means that additional (n-3) diagonals can be drawn in any (n-3)-quadrilaterals. Based on this, we can conclude that in any regular partition it is possible to draw (n-3)-diagonals that meet the conditions of this problem.

Area of ​​convex polygons

Often, when solving various problems of elementary geometry, it becomes necessary to determine the area of ​​a convex polygon. Suppose (Xi. Yi), i = 1,2,3… n is the sequence of coordinates of all neighboring vertices of a polygon that does not have self-intersections. In this case, its area is calculated by the following formula:

S = ½ (∑ (X i + X i + 1) (Y i + Y i + 1)),

where (X 1, Y 1) = (X n +1, Y n + 1).

The concept of a polygon

Definition 1

polygon called a geometric figure in a plane, which consists of pairwise interconnected segments, neighboring of which do not lie on one straight line.

In this case, the segments are called polygon sides, and their ends are polygon vertices.

Definition 2

An $n$-gon is a polygon with $n$ vertices.

Types of polygons

Definition 3

If a polygon always lies on one side of any line passing through its sides, then the polygon is called convex(Fig. 1).

Figure 1. Convex polygon

Definition 4

If the polygon lies on opposite sides of at least one straight line passing through its sides, then the polygon is called non-convex (Fig. 2).

Figure 2. Non-convex polygon

The sum of the angles of a polygon

We introduce the theorem on the sum of angles of a -gon.

Theorem 1

The sum of the angles of a convex -gon is defined as follows

\[(n-2)\cdot (180)^0\]

Proof.

Let us be given a convex polygon $A_1A_2A_3A_4A_5\dots A_n$. Connect its vertex $A_1$ to all other vertices of the given polygon (Fig. 3).

Figure 3

With such a connection, we get $n-2$ triangles. Summing their angles, we get the sum of the angles of the given -gon. Since the sum of the angles of a triangle is $(180)^0,$ we get that the sum of the angles of a convex -gon is determined by the formula

\[(n-2)\cdot (180)^0\]

The theorem has been proven.

The concept of a quadrilateral

Using the definition of $2$, it is easy to introduce the definition of a quadrilateral.

Definition 5

A quadrilateral is a polygon with $4$ vertices (Fig. 4).

Figure 4. Quadrilateral

For a quadrilateral, the concepts of a convex quadrilateral and a non-convex quadrilateral are similarly defined. Classical examples of convex quadrangles are a square, a rectangle, a trapezoid, a rhombus, a parallelogram (Fig. 5).

Figure 5. Convex quadrilaterals

Theorem 2

The sum of the angles of a convex quadrilateral is $(360)^0$

Proof.

By Theorem $1$, we know that the sum of the angles of a convex -gon is determined by the formula

\[(n-2)\cdot (180)^0\]

Therefore, the sum of the angles of a convex quadrilateral is

\[\left(4-2\right)\cdot (180)^0=(360)^0\]

The theorem has been proven.