Rectifications of Convex Polyhedra
classification
🧮 math.MG
keywords
convexareaspolyhedrapolyhedronrectificationrectificationssequencesclosed
read the original abstract
A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive expressions for the side lengths and areas of rectifications of regular polygons in plane, and use these results to compute surface areas and volumes of various convex polyhedra. We introduce rectification sequences and show that there are exactly two disjoint pure rectification sequences generated by the platonic solids.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.