This article needs additional citations for verification. (July 2022)
In geometry, a vertex ( PL: vertices or vertexes) is a point where two or more curves, lines, or edges meet or intersect. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedra are vertices.   
The vertex of an angle is the point where two rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place.  
In a polygon, a vertex is called " convex" if the internal angle of the polygon (i.e., the angle formed by the two edges at the vertex with the polygon inside the angle) is less than π radians (180°, two right angles); otherwise, it is called "concave" or "reflex".  More generally, a vertex of a polyhedron or polytope is convex, if the intersection of the polyhedron or polytope with a sufficiently small sphere centered at the vertex is convex, and is concave otherwise.[ citation needed]
Polytope vertices are related to vertices of graphs, in that the 1-skeleton of a polytope is a graph, the vertices of which correspond to the vertices of the polytope,  and in that a graph can be viewed as a 1-dimensional simplicial complex the vertices of which are the graph's vertices.[ citation needed]
However, in graph theory, vertices may have fewer than two incident edges, which is usually not allowed for geometric vertices. There is also a connection between geometric vertices and the vertices of a curve, its points of extreme curvature: in some sense the vertices of a polygon are points of infinite curvature, and if a polygon is approximated by a smooth curve, there will be a point of extreme curvature near each polygon vertex.  However, a smooth curve approximation to a polygon will also have additional vertices, at the points where its curvature is minimal.[ citation needed]
A vertex of a plane tiling or tessellation is a point where three or more tiles meet;  generally, but not always, the tiles of a tessellation are polygons and the vertices of the tessellation are also vertices of its tiles. More generally, a tessellation can be viewed as a kind of topological cell complex, as can the faces of a polyhedron or polytope; the vertices of other kinds of complexes such as simplicial complexes are its zero-dimensional faces.[ citation needed]
A polygon vertex xi of a simple polygon P is a principal polygon vertex if the diagonal x(i − 1), x(i + 1) intersects the boundary of P only at x(i − 1) and x(i + 1). There are two types of principal vertices: ears and mouths. 
A principal vertex xi of a simple polygon P is called an ear if the diagonal x(i − 1), x(i + 1) that bridges xi lies entirely in P. (see also convex polygon) According to the two ears theorem, every simple polygon has at least two ears. 
A principal vertex xi of a simple polygon P is called a mouth if the diagonal x(i − 1), x(i + 1) lies outside the boundary of P.
where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of vertices is 2 more than the excess of the number of edges over the number of faces. For example, since a cube has 12 edges and 6 faces, the formula implies that it has eight vertices.[ citation needed]
In computer graphics, objects are often represented as triangulated polyhedra in which the object vertices are associated not only with three spatial coordinates but also with other graphical information necessary to render the object correctly, such as colors, reflectance properties, textures, and surface normal.  These properties are used in rendering by a vertex shader, part of the vertex pipeline.