2017
DOI: 10.3390/sym9030041
|View full text |Cite
|
Sign up to set email alerts
|

The Roundest Polyhedra with Symmetry Constraints

Abstract: 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 constrai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 15 publications
(25 reference statements)
0
4
0
Order By: Relevance
“…where V is the volume and S is the surface of the polyhedron. By definition the sphere has an IQ = 1, and this is the maximum possible value of the parameter [53]. The values of IQ for the regular dodecahedron and the truncated octahedron are as follows:…”
Section: Fig 9 a Prototype Of The Planar Meta-array With 7 Triangular...mentioning
confidence: 99%
“…where V is the volume and S is the surface of the polyhedron. By definition the sphere has an IQ = 1, and this is the maximum possible value of the parameter [53]. The values of IQ for the regular dodecahedron and the truncated octahedron are as follows:…”
Section: Fig 9 a Prototype Of The Planar Meta-array With 7 Triangular...mentioning
confidence: 99%
“…10 −30 . This is due to the interference of rounding errors [ 22 ], which result from the inexactness in the representation of real numbers and the arithmetic operations done with them. For example, the theoretical value of ln(1) is 0 obviously, yet it equals 2.2204 × 10 −16 in Matlab, due to the limitation of 16 digits of precision [ 20 ].…”
Section: Optimizing the Cage’s Geometrymentioning
confidence: 99%
“…There are various methods to generate cages with different geometric properties. For example, one can derive spherical cages by vertex elimination [ 5 ], cages with planar faces through three-dimensional reciprocal construction [ 5 ], cages with equal-length edges by trigonometry [ 20 ] or optimization [ 21 ], and ‘the roundest polyhedra’ using numerical approaches [ 7 , 22 , 23 ]. Remarkably, cages with planar faces and simultaneously equal-length edges can be obtained by nulling the dihedral angle discrepancies [ 21 ].…”
Section: Introductionmentioning
confidence: 99%
“…The vertices of the resulting mesh, projected centrally onto the sphere, create a polyhedron approximating the sphere, in which only the nodes lie on the sphere's surface. This process can be found in the works of J. Clinton [2,3], T. Tarnai [4][5][6], P. Huybers [7][8][9][10][11][12], G. N. Pavlov [13,14], C. Kitrick [15,16], H. Lalvani [17][18][19][20], M. Wenninger [21,22], J. Rębielak [23], H.S.M. Coxeter [24], J. Fuli ński [25], and many others.…”
Section: Introductionmentioning
confidence: 99%