2000 character limit reached
Rectifications of Convex Polyhedra (1604.00580v1)
Published 3 Apr 2016 in math.MG
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.