This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Discrete geometry | |
|---|---|
| Name | Discrete geometry |
| Field | Mathematics |
Discrete geometry is the branch of mathematics concerned with the study of combinatorial and constructive properties of discrete sets of geometric objects. It connects rigorous results about finite or countable configurations of points, lines, polytopes, and graphs with algorithmic and structural questions studied across Princeton University, École Normale Supérieure, University of Cambridge, Harvard University, and other centers. The subject synthesizes methods from Paul Erdős-style extremal reasoning, Steinitz-era polytope theory, and computational perspectives inspired by Alan Turing and Donald Knuth.
Discrete geometry treats finite or countable arrangements of geometric primitives such as points, segments, polygons, polyhedra, and graphs embedded in Euclidean space, in contrast to continuous fields studied at Courant Institute, Max Planck Society, and Institut Henri Poincaré. Key scope items include combinatorial geometry problems popularized by Paul Erdős, structural classification of polytopes developed after Branko Grünbaum and Hermann Minkowski, and packing and covering questions studied at London Mathematical Society gatherings. The scope also embraces computational complexity issues highlighted by results from Leslie Valiant, Richard Karp, and Michael Rabin.
Core objects include finite point sets studied in the spirit of Sylvester–Gallai theorem work connected to G. H. Hardy-era problems, convex hulls in the tradition of Hermann Minkowski and Steinitz, and polytopes as treated by Victor Klee and Richard Stanley. Other fundamental concepts are arrangements of lines and hyperplanes as in the research of Peter McMullen and Maya Przybylska, planar graphs with ties to William Tutte and Paul Seymour, Voronoi diagrams and Delaunay triangulations reflecting work by Georges Voronoï and Boris Delaunay, and tilings and packings influenced by Johannes Kepler-linked conjectures and proofs by Thomas Hales. Combinatorial rigidity theory connects to the legacy of James Clerk Maxwell and later developments by Jack Graver and Walter Whiteley. Lattice point enumeration relates to results by Eugène Ehrhart and algebraic combinatorics approaches from Richard Stanley and Gian-Carlo Rota. Concepts of geometric discrepancy link to investigations by József Beck and William Chen.
Seminal results include the Erdős–Szekeres theorem that generalizes monotone subsequences and convex k-gons studied by Paul Erdős and George Szekeres, Helly’s theorem with contributions from Eduard Helly and generalizations pursued by David Gale, Carathéodory’s theorem traced to Constantin Carathéodory, and Radon’s theorem named for Johannes Radon. Theorems classifying f-vectors of simplicial polytopes derive from the g-theorem proved through work of Louis Billera, Richard Stanley, Günter Ziegler, and Louis J. Billera. Tverberg’s theorem and its colorful variants link to Helge Tverberg and later improvements by Imre Bárány and Pavel Valtr. The Kepler conjecture resolution is associated with Thomas Hales and the Flyspeck Project; the Hadwiger conjecture and Minkowski’s theorem represent major open and resolved milestones respectively, with Minkowski tied to Hermann Minkowski. Crossing number inequalities and planar separator theorems connect to János Pach, Miklós Ajtai, and Rafael Tamassia. Discrete isoperimetric inequalities and results on lattice points reflect work of Eugène Ehrhart and George D. Birkhoff.
Algorithmic discrete geometry includes convex hull algorithms inspired by Jack E. Bentley and Franco P. Preparata, Voronoi/Delaunay constructions linked to Steven Fortune and Leonidas Guibas, and triangulation and mesh generation methods used by Richard Shewchuk and Herbert Edelsbrunner. Complexity classifications relate to Richard Karp-type NP-completeness results for geometric problems and to approximation schemes in the spirit of Umesh Vazirani and David Zuckerman. Geometric data structures such as arrangement maintenance and range searching draw on contributions from Peter van Emde Boas and Jeff Erickson, while randomized and streaming techniques reflect paradigms from Michael Mitzenmacher and Sanjeev Arora. Optimization over discrete geometric objects employs linear programming methods tracing to George Dantzig and cutting-plane approaches linked to Jack Edmonds.
Applications span computational geometry uses in NASA mission planning, computer graphics developments at Pixar and Industrial Light & Magic, geographic information systems employed by Esri, and sensor network coverage influenced by Vint Cerf-era networking needs. Crystallography and materials science applications connect to Max von Laue and Linus Pauling-inspired studies of lattice packings; coding theory and communications draw on sphere-packing results tied to Claude Shannon and Richard Hamming. Robotics and motion planning use combinatorial cell decompositions inspired by John Hopcroft and Mitchell R. Kapor; computational biology and structural genomics adapt triangulation and mesh techniques from David Baker and Michael Levitt. Connections to theoretical computer science appear via complexity results from Leslie Valiant and algorithmic paradigms explored at DIMACS workshops.
The field’s roots include classical geometry from Euclid and packing ideas from Kepler; the modern combinatorial focus grew through the 20th century with major contributors like Paul Erdős, Branko Grünbaum, Hermann Minkowski, Eugène Ehrhart, and Victor Klee. Foundational algorithmic influences emerge from Alan Turing and John von Neumann, while later algorithmic and combinatorial consolidation involved Jack Edmonds, Richard Karp, Peter Shor, Günter Ziegler, and János Pach. Institutional hubs and conferences at SIAM, ACM, International Congress of Mathematicians, and research groups at MIT, Princeton University, University of Bonn, and ETH Zurich shaped directions. Contemporary advances continue through collaboration among scholars such as Imre Bárány, János Pach, Miklós Bárány, and Rade T. Živaljević.