Barycentric subdivision
Builds on Simplicial complexConvex hull
Definition
Let be a geometric simplicial complex in , so each simplex of is the convex hull of affinely independent vertices . The barycentre of is the point The barycentric subdivision is the geometric simplicial complex with the following simplices. For each chain of simplices of , it has the convex hull of .
Remarks
The union of the simplices of equals the union of the simplices of , and each simplex of lies in a simplex of . If every simplex of has diameter at most and has dimension at most , then every simplex of has diameter at most .
For an abstract simplicial complex , the vertices of are the nonempty faces of . The faces of are the finite chains of nonempty faces under inclusion.
Example: let be a -simplex with vertices and all its faces. The maximal chains are for the ordered pairs , so has triangles, vertices and edges.
Non-example: cutting the triangle into triangles by joining its centroid to the three corners gives a subdivision, but not the barycentric one. The barycentres of the edges are not vertices of it, though each edge is a simplex of .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex hull concept
- Simplicial complex concept
- Barycentric subdivision definition
Further reading
About this page
| Tag | 5PVK5PVZBA |
|---|---|
| URI | m2://5PVK5PVZBA |
| Kind | definition |
| Writing | W0 stub |
| MSC | 55U10, 57Q05 |
| Defines | Barycentric subdivision |
| Uses | Simplicial complex, Convex hull |
| Changed | 2 November 2026 |
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.