Discrete geometry

From Wikipedia, the free encyclopedia
Jump to: navigation, search
A collection of circles and the corresponding unit disk graph
"Combinatorial geometry" redirects here. The term combinatorial geometry is also used in the theory of matroids to refer to a simple matroid, especially in older texts.

Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object.

Discrete geometry has large overlap with convex geometry and computational geometry, and is closely related to subjects such as finite geometry, combinatorial optimization, digital geometry, discrete differential geometry, geometric graph theory, toric geometry, and combinatorial topology.


Although polyhedra and tessellations have been studied for many years by people such as Kepler and Cauchy, modern discrete geometry has its origins in the late 19th century. Early topics studied were: the density of circle packings by Thue, projective configurations by Reye and Steinitz, the geometry of numbers by Minkowski, and map colourings by Tait, Heawood, and Hadwiger.

Topics in discrete geometry[edit]

  • Geometric set partitioning and transversals

See also[edit]