Vertex, Edge, Diagonal and Classifying 2D Figures
A vertex is a meeting point of polygon sides, an edge or side is a boundary segment, and a diagonal joins two nonadjacent vertices. In brief: a pentagon has five sides, five vertices and five diagonals. Classifying 2D figures uses these features together with properties such as equal lengths, parallel sides and angles.
A figure’s orientation or apparent size does not determine its class. A rotated square is still a square, and a concave polygon still has straight sides and vertices. This guide explains the vocabulary, polygon naming, diagonal counting and the conditions needed for accurate classification.
What is a two-dimensional figure?
A two-dimensional figure lies in a plane and can have length and width without three-dimensional thickness. Examples include triangles, rectangles, circles and irregular regions. A physical paper cutout has some thickness, but its flat outline can represent an ideal plane figure.
Not every plane figure is a polygon. A polygon has a closed boundary made of finitely many straight segments. A circle has a curved boundary and therefore is not a polygon, even though it is a familiar two-dimensional figure.
This article uses simple polygons, whose sides meet only at shared endpoints and do not cross one another. Self-intersecting star outlines need additional conventions for some counting and angle statements. Establishing the type of boundary first keeps later classification rules from being applied outside their intended setting.
What are vertices, sides and edges?
A vertex is a corner where two consecutive polygon sides meet. The plural is vertices. A side is one of the straight boundary segments joining neighboring vertices. The word edge is sometimes used for a polygon side, though it is especially common when describing three-dimensional solids.
A simple polygon has the same number of sides and vertices. A triangle has three of each, a quadrilateral four and a hexagon six. Listing the vertices in order around the boundary makes the side connections clear: in pentagon ABCDE, the sides are AB, BC, CD, DE and EA.
A point marked along the middle of a straight side does not automatically create a new geometric corner. Polygon naming generally uses the actual boundary vertices under the given definition, not every label added for a construction. Read which points the problem identifies as vertices before counting.
What is a diagonal of a polygon?
A diagonal joins two vertices that are not adjacent along the polygon boundary. In a quadrilateral ABCD, AC and BD are diagonals, while AB and BC are sides. A segment from a vertex to the midpoint of another side is not a diagonal because its second endpoint is not a vertex.
A diagonal need not be horizontal, vertical or visually slanted in a particular way. The endpoint relationship defines it. Rotating the polygon changes how the segment looks on the page but does not turn a side into a diagonal or vice versa.
In a convex polygon every diagonal lies inside the polygon apart from its endpoints. In a concave polygon some diagonals pass partly outside the region. They remain diagonals because they still connect nonadjacent vertices; interior location is a property of convexity, not part of the general diagonal definition.
How are polygons named by their number of sides?
The number of sides supplies the broad polygon name. Three sides give a triangle, four a quadrilateral, five a pentagon and six a hexagon. The name does not by itself imply equal sides or equal angles.
Thus an irregular six-sided figure is still a hexagon, and a concave five-sided figure is still a pentagon if its boundary is a simple polygon. Additional adjectives describe properties within the broad class. Count the boundary segments systematically rather than matching the picture to one familiar textbook shape.
The table covers each side count from 3 through 10 without gaps. For larger counts, an n-gon is a useful general term. This makes formulas possible without inventing a separate argument for every named polygon.
| Sides | Vertices | Name |
|---|---|---|
| 3 | 3 | Triangle |
| 4 | 4 | Quadrilateral |
| 5 | 5 | Pentagon |
| 6 | 6 | Hexagon |
| 7 | 7 | Heptagon |
| 8 | 8 | Octagon |
| 9 | 9 | Nonagon |
| 10 | 10 | Decagon |
What do regular, irregular, convex and concave mean?
A regular polygon has all sides equal and all interior angles equal. Both conditions are needed. A rhombus can have equal sides without equal angles, and a non-square rectangle has equal angles without equal sides, so neither is regular in general.
A convex polygon has every interior angle below 180° and no inward indentation. A concave simple polygon has at least one interior angle greater than 180°. Another useful distinction is that a segment joining two points inside a convex region stays inside it, while a concave region can fail that property.
Regularity and convexity describe different features, although the ordinary regular polygons in elementary geometry are convex. An irregular polygon can still be convex. Do not use ‘irregular’ as a synonym for concave, crooked or self-intersecting; it simply means the regularity conditions are not all satisfied.
How do you classify a figure step by step?
Begin by checking whether the boundary is closed and made entirely of straight segments. If so, count the sides and vertices to identify the polygon family. Then inspect or use stated information about equal lengths, parallel sides and angle measures.
For a four-sided figure with four right angles, the figure is a rectangle. If all four sides are equal as well, it is also a square. These are overlapping classes: a square satisfies the rectangle definition, so classification does not always require choosing only one label.
Use given marks and definitions rather than appearance alone. Matching tick marks indicate equal lengths, parallel arrows indicate parallel sides and a square angle mark indicates a right angle. A drawing that looks like a square is not enough to prove all its required properties unless the task explicitly permits measurement or supplies them.
- Check for a closed straight-sided boundary.
- Count the sides and vertices.
- Read equality, parallelism and angle information.
- Apply every classification whose defining conditions are met.
How do you count a polygon’s diagonals?
From one vertex of an n-sided polygon, you cannot draw a diagonal to itself or to its two adjacent vertices. That leaves n − 3 possible diagonal endpoints. Multiplying by n counts each diagonal twice, once from each end.
Therefore the total number of diagonals is n(n − 3)/2. For a pentagon, this gives 5 × 2/2 = 5. For a hexagon, it gives 6 × 3/2 = 9. A triangle gives zero because all pairs of vertices are already joined by sides.
The formula counts the straight connections between nonadjacent vertices, whether or not each lies inside a concave polygon. It does not count intersection points where diagonals cross. Those intersections are different objects and require a separate question and, sometimes, extra assumptions about the polygon’s arrangement.
| Polygon | Calculation | Diagonals |
|---|---|---|
| Triangle | 3 × 0 ÷ 2 | 0 |
| Quadrilateral | 4 × 1 ÷ 2 | 2 |
| Pentagon | 5 × 2 ÷ 2 | 5 |
| Hexagon | 6 × 3 ÷ 2 | 9 |
| Octagon | 8 × 5 ÷ 2 | 20 |
Why is classification useful and which mistakes are common?
Geometric classification groups figures by properties that remain meaningful when the drawing is moved, rotated or resized. This background supports general statements: a theorem about all rectangles also applies to squares because squares meet the rectangle definition. The hierarchy depends on definitions rather than visual stereotypes.
Practical uses include recognizing the faces of objects, selecting area formulas and describing a design precisely. A six-sided outline may be called a hexagon, but calculating its area still requires dimensions or additional structure; the family name alone does not supply a universal numerical measurement.
Common mistakes include counting marked non-corner points as vertices, calling any slanted segment a diagonal and treating equal sides alone as proof of regularity. Also avoid assuming categories are mutually exclusive. Check endpoints, boundary structure and the full set of defining conditions before assigning or rejecting a label.