Convex and discrete geometry Definition
Simplicial polytope
Builds on Convex polytopeFacetConvex hull
Definition
A -simplex is the convex hull of affinely independent points. Let be a convex polytope of dimension . is simplicial if every facet of is a -simplex.
Remarks
Equivalently, every proper face of is a simplex, since each face of a simplex is a simplex. Equivalently again, every facet of has exactly vertices.
Example: the octahedron in is simplicial. Its facets are the eight triangles with , and each is the hull of affinely independent points.
Non-example: the cube is not simplicial, because its facets are squares with vertices.
Every polygon is simplicial, since its facets are segments. The convex hull of finitely many points in general position in , with at least of them, is simplicial.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex hull concept
- Convex polytope concept
- Facet concept
- Simplicial polytope definition
Further reading
About this page
| Tag | 6F4JHFDM19 |
|---|---|
| URI | m2://6F4JHFDM19 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52B05, 52B11, 52B12 |
| Defines | Simplicial polytope |
| Uses | Convex polytope, Facet, Convex hull |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.