The roundest polyhedra with symmetry constraints

From MaRDI portal
Publication:2333481





Summary: Amongst the convex polyhedra with \(n\) faces circumscribed about the unit sphere, which has the minimum surface area? This is the isoperimetric problem in discrete geometry which is addressed in this study. The solution of this problem represents the closest approximation of the sphere, i.e., the roundest polyhedra. A new numerical optimization method developed previously by the authors has been applied to optimize polyhedra to best approximate a sphere if tetrahedral, octahedral, or icosahedral symmetry constraints are applied. In addition to evidence provided for various cases of face numbers, potentially optimal polyhedra are also shown for \(n\) up to 132.











This page was built for publication: The roundest polyhedra with symmetry constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333481)