Convex and discrete geometry Discrete and combinatorial geometry Concept
Discrete geometry
Summary
Discrete geometry is the part of geometry that studies finite or discrete configurations of simple objects, such as points, lines, circles, polygons and convex bodies. Its questions are combinatorial: how many incidences, distances or intersections such configurations can have. Typical topics are tilings, sphere packings, polytopes, incidence problems and geometric graphs. It is closely tied to convex geometry and to computational geometry.
Further reading
About this page
| Tag | Q0RW86P85F |
|---|---|
| URI | m2://Q0RW86P85F |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C99, 52C10, 52C35 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.