Discrete geometry studies finite or discrete configurations of geometric objects, such as points, lines, circles, polytopes, and packings. Typical questions count incidences, optimize separation or coverage, or determine which combinatorial patterns can be realized geometrically.
For example, distinct points in the Euclidean plane determine at most different lines, because every determined line contains a pair of points. Equality holds when no three points are collinear; collinearity merges several pairs into the same line. This simple argument connects a geometric degeneracy to a change in a counting problem.
Other problems ask how many equal disks can touch a given disk without overlapping, or how a polygon can be triangulated. Convex geometry, graph theory, and computational geometry supply complementary tools: coordinates constrain realizability, while a combinatorial description records which objects meet.
Discrete geometry is a branch of mathematics that studies geometric objects and properties in a discrete setting, as opposed to continuous geometry. It focuses on structures that are made up of distinct, separate elements rather than continuous shapes or surfaces. This can include the study of points, lines, polygons, polyhedra, and more complex shapes, particularly in finite or countable settings.
New to topics? Read the docs here!