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 a...

This paper discusses patterns on triply periodic polyhedra, infinite polyhedra that repeat in three independent directions in Euclidean 3-space. We further require that all the vertices be congruent by a symmetry of the polyhedron, i.e. that they be uniform, and also that each of the faces is a single regular polygon. We believe that we are the first to apply patterns to such polyhedra. The pat...

A chiral polyhedron has a geometric symmetry group with two orbits on the flags, such that adjacent flags are in distinct orbits. Part I of the paper described the discrete chiral polyhedra in ordinary Euclidean space E3 with finite skew faces and finite skew vertex-figures; they occur in infinite families and are of types {4, 6}, {6, 4} and {6, 6}. Part II completes the enumeration of all disc...

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex faces and one with 36 triangular faces, that cannot be unfolded by cutting along edges. We further ...

This paper presents a technique for constructing new chiral or regular polyhedra (or maps) from self-dual abstract chiral polytopes of rank 4. From improperly self-dual chiral polytopes we derive “Petrie-Coxeter-type” polyhedra (abstract chiral analogues of the classical Petrie-Coxeter polyhedra) and investigate their groups of automorphisms.

Since the seminal work of Cousot and Halbwachs, the domain of convex polyhedra has been employed in several systems for the analysis and verification of hardware and software components. Although most implementations of the polyhedral operations assume that the polyhedra are topologically closed (i.e., all the constraints defining them are non-strict), several analyzers and verifiers need to co...

Large crystalline molecular shells, such as some viruses and fullerenes, buckle spontaneously into icosahedra. Meanwhile multicomponent microscopic shells buckle into various polyhedra, as observed in many organelles. Although elastic theory explains one-component icosahedral faceting, the possibility of buckling into other polyhedra has not been explored. We show here that irregular and regula...

The domain of convex polyhedra is employed in several systems for the analysis and verification of hardware and software components. Current applications span imperative, functional and logic languages, synchronous languages and synchronization protocols, real-time and hybrid systems. Since the seminal work of P. Cousot and N. Halbwachs, convex polyhedra have thus played an important role in th...

Template polyhedra generalize weakly relational domains by specifying arbitrary fixed linear expressions on the left-hand sides of inequalities and undetermined constants on the right. The domain operations required for analysis over template polyhedra can be computed in polynomial time using linear programming. In this paper, we introduce the generalized template polyhedral domain that extends...