Vertex

Vertex
Name	Vertex

Vertex is a term used across mathematics, computer science, physics, and engineering to denote a distinguished point where structures meet. In mathematics it commonly denotes a corner or junction in geometry and graph theory, while in computer graphics and computational geometry it represents a programmable data element used to model shapes and scenes. The term appears in the study of group theory, spectral graph theory, polyhedron theory, computational topology, and in applied fields such as computer-aided design and finite element method.

Definition and terminology

In formal nomenclature a vertex denotes a singular point characterized by meeting or intersection: in Euclidean geometry it is the intersection of line segments or rays, in graph theory it is an abstract element incident to edges, and in polyhedral combinatorics it is an extreme point of a convex set. Historical terminology traces usage through works by Euclid and later formalization in texts by René Descartes and Leonhard Euler. Alternate terms appear in specialized contexts: "node" in network theory and electrical engineering, "corner" in architectural literature such as Gothic architecture studies, and "atom" in certain chemical graph theory treatments.

Types and properties

Vertices come in many classified types. In planar graph drawing contexts one distinguishes articulation vertices (cut-vertices) studied by Tibor Gallai and William Tutte from degree-regular vertices considered by Paul Erdős in extremal graph problems. In geometry vertices may be convex, concave, reflex, simple, or singular as examined in works by Cauchy and Alexandrov. In polyhedral theory vertices are classified as simple, multiple, or non-manifold points in analyses by Branko Grünbaum and Victor Klee. Topological properties such as manifoldness, boundary conditions, and local link structure connect to results by Hermann Weyl and John Milnor on singularities and Morse theory.

Vertex in graph theory

A vertex in graph theory is an element of the vertex set incident to edges; foundational theorems by Leonhard Euler on the Seven Bridges of Königsberg problem established vertices' role in connectivity. Classical invariants associated with vertices include degree, eccentricity, betweenness centrality as studied in Linton Freeman's social network analyses, and chromatic constraints related to the Four Color Theorem proven by Kenneth Appel and Wolfgang Haken. Vertex-transitive and Cayley graph constructions relate to Évariste Galois-inspired group actions and studied by Marston Conder and C. D. Godsil. Algorithms for vertex-centric problems—vertex cover, vertex coloring, vertex connectivity—feature in complexity results by Richard Karp and approximation schemes in the work of David Johnson.

Vertex in geometry and polyhedra

In Euclidean geometry a vertex is the intersection of two or more edges; in polygonal theory vertices determine interior angles and are central to the Gauss–Bonnet theorem generalizations by Pierre Ossian Bonnet and Carl Friedrich Gauss. In polyhedron theory the vertex set forms extreme points of convex polytopes treated by Gustav Herglotz and Hermann Minkowski; results such as Euler's polyhedral formula link vertex counts with edge and face counts, a relation explored by August Möbius and Cauchy for rigidity. Vertex figures, stellation, and truncation operations studied by John Conway and H. S. M. Coxeter manipulate vertex arrangements to generate Archimedean and Catalan solids, while singular vertices arise in the study of orbifolds by William Thurston.

Vertex in computer graphics and computational geometry

In computer graphics a vertex is a programmable record containing position, normal, texture coordinates and attributes used by OpenGL and DirectX rendering pipelines; shader programs by John Carmack and architectures from NVIDIA exploit vertex processing. Mesh representations—triangle meshes, winged-edge, half-edge data structures—encode vertices for efficient traversal and subdivision schemes such as those by Doosabin and Catmull and Terry D. Clark. In computational geometry vertices are critical in algorithms for convex hulls (Preparata and Shamos), Delaunay triangulation (work by Boris Delaunay and Franco P. Preparata), and Voronoi diagrams (conceived by Georgy Voronoy); robust handling of degeneracies at coincident or nearly-coincident vertices is a focal point in numerical geometry by Herbert Edelsbrunner.

Algebraic and spectral perspectives on vertices

Algebraic graph theory studies vertices via adjacency matrices and Laplacians where eigenvectors localize on vertices in investigations by Fan R. K. Chung and Mihailo R. Stošić. The concept of vertex in polyhedral combinatorics appears as extreme points of linear programs in works by George Dantzig and Jack Edmonds; vertices correspond to basic feasible solutions in the simplex method. Spectral properties such as vertex expansion and Cheeger inequalities were developed by Jeff Cheeger and adapted to combinatorial expansions by Noga Alon and Shlomo Hoory, linking vertex sets to measure concentration and random walks studied by Persi Diaconis.

Applications and examples

Vertices serve as primitives across applications: in finite element method meshes vertices hold nodal values for simulations referenced in studies by Richard Courant and O. C. Zienkiewicz; in computer vision feature detectors such as Harris corner detector by Chris Harris identify salient image vertices; in network science vertices model actors in social graphs investigated by Mark Granovetter and Duncan Watts. In chemistry vertices represent atoms in molecular graphs used by Linus Pauling and Roald Hoffmann, while in electrical engineering vertices correspond to circuit nodes treated in textbooks by James Clerk Maxwell-inspired formalisms and modern circuit analysis by Charles Alexander.

Category:Mathematics Category:Computer science Category:Geometry