The roundest polyhedra with symmetry constraints
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.
- Covering a sphere by equal circles, and the rigidity of its graph
- Discrete and Computational Geometry
- Fourth class of convex equilateral polyhedron with polyhedral symmetry related to fullerenes and viruses
- Fullerenes and coordination polyhedra versus half-cube embeddings
- Hidden geometrical treasures
- How spherical are the Archimedean solids and their duals?
- scientific article; zbMATH DE number 3155900 (Why is no real title available?)
- scientific article; zbMATH DE number 10363 (Why is no real title available?)
- scientific article; zbMATH DE number 3016051 (Why is no real title available?)
- scientific article; zbMATH DE number 3369404 (Why is no real title available?)
- scientific article; zbMATH DE number 3027569 (Why is no real title available?)
- scientific article; zbMATH DE number 3090128 (Why is no real title available?)
- The Isepiphan Problem for n-Hedra
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)