Geometric combinatorics
id:
geometric-combinatorics-284-4543935
title:
Geometric combinatorics
text:
Geometric combinatorics is a branch of mathematics in general and combinatorics in particular. It includes a number of subareas such as polyhedral combinatorics, convex geometry, and discrete geometry, which in turn has many applications to computational geometry. Other important areas include metric geometry of polyhedra, such as the Cauchy theorem on rigidity of convex polytopes. The study of regular polytopes, Archimedean solids, and kissing numbers is also a part of geometric combinatorics.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Geometric_combinatorics
date created:
date modified:
2021-04-28T19:23:58Z
main entity:
{"identifier":"Q5535478","url":"https://www.wikidata.org/entity/Q5535478"}
image:
fields total:
13
integrity:
13