Editing Discrete geometry (section)

{{Short description|Branch of geometry that studies combinatorial properties and constructive methods}}
{{Redirect|Combinatorial geometry|text=The term combinatorial geometry is also used in the theory of [[matroid]]s to refer to a [[simple matroid]], especially in older texts}}
[[Image:Unit disk graph.svg|thumb|right|A collection of [[circle]]s and the corresponding [[unit disk graph]]]]
'''Discrete geometry''' and '''combinatorial geometry''' are branches of [[geometry]] that study [[Combinatorics|combinatorial]] properties and constructive methods of [[discrete mathematics|discrete]] geometric objects.  Most questions in discrete geometry involve [[finite set|finite]] or [[Discrete space|discrete]] [[set (mathematics)|sets]] of basic geometric objects, such as [[point (geometry)|point]]s, [[line (geometry)|lines]], [[plane (geometry)|plane]]s, [[circle]]s, [[sphere]]s, [[polygon]]s, and so forth.  The subject focuses on the combinatorial properties of these objects, such as how they [[intersection (set theory)|intersect]] one another, or how they may be arranged to cover a larger object.

Discrete geometry has a 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]].