Discrete geometry

Discrete geometry
A collection of circles and the corresponding unit disk graph

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

  • Geometric set partitioning and transversals

See also


  • Bezdek, András; Kuperberg, W. (2003). Discrete geometry: in honor of W. Kuperberg's 60th birthday. New York, N.Y: Marcel Dekker. ISBN 0-8247-0968-3. 
  • Bezdek, Károly (2010). Classical Topics in Discrete Geometry. New York, N.Y: Springer. ISBN 978-1-4419-0599-4. 
  • Brass, Peter; Moser, William; Pach, János (2005). Research problems in discrete geometry. Berlin: Springer. ISBN 0-387-23815-8. 
  • Goodman, Jacob E. and O'Rourke, Joseph (2004). Handbook of Discrete and Computational Geometry, Second Edition. Boca Raton: Chapman & Hall/CRC. ISBN 1-58488-301-4. 
  • Gruber, Peter M. (2007). Convex and Discrete Geometry. Berlin: Springer. ISBN 3-540-71132-5. 
  • Matoušek, Jiří (2002). Lectures on discrete geometry. Berlin: Springer. ISBN 0-387-95374-4. 
  • Vladimir Boltyanski, Horst Martini, Petru S. Soltan, (1997). Excursions into Combinatorial Geometry. Springer. ISBN 3-540-61341-2. 

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Geometry — (Greek γεωμετρία ; geo = earth, metria = measure) is a part of mathematics concerned with questions of size, shape, and relative position of figures and with properties of space. Geometry is one of the oldest sciences. Initially a body of… …   Wikipedia

  • Discrete and Computational Geometry — Discrete Computational Geometry   …   Wikipedia

  • Discrete mathematics — For the mathematics journal, see Discrete Mathematics (journal). Graphs like this are among the objects studied by discrete mathematics, for their interesting mathematical properties, their usefulness as models of real world problems, and their… …   Wikipedia

  • Discrete differential geometry — is the study of discrete counterparts of notions in differential geometry. Instead of smooth curves and surfaces, there are polygons, meshes, and simplicial complexes. It is used in the study of computer graphics and topological combinatorics.… …   Wikipedia

  • Discrete Morse theory — is a combinatorial adaptation of Morse theory defined on finite CW complexes. Contents 1 Notation regarding CW complexes 2 Discrete Morse functions 3 The Morse complex …   Wikipedia

  • GEOMETRY — Discrete & Computational Geometry (informationswissenschaftl. Veoeffentlichungen) …   Acronyms

  • GEOMETRY — Discrete & Computational Geometry (informationswissenschaftl. Veröffentlichungen) …   Acronyms von A bis Z

  • Geometry and topology — In mathematics, geometry and topology is an umbrella term for geometry and topology, as the line between these two is often blurred, most visibly in local to global theorems in Riemannian geometry, and results like the Gauss–Bonnet theorem and… …   Wikipedia

  • Discrete dipole approximation codes — This article contains list of discrete dipole approximation codes and their applications. The discrete dipole approximation (DDA) is a flexible technique for computing scattering and absorption by targets of arbitrary geometry. Given a target of… …   Wikipedia

  • Discrete tomography — A discrete tomography reconstruction problem for two vertical and horizontal directions (left), together with its (non unique) solution (right). The task is to color some of the white points black so that the number of black points in the rows… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.