Related papers: Sufficiently Fat Polyhedra are not 2-castable

In this article we review some problems in physics, chemistry and mathematics that lead naturally to a class of polyhedra which include the Platonic solids. Examples include the study of electrons on a sphere, cages of carbon atoms, central…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

We prove that for any convex polygon $S$ with at least four sides, or a concave one with no parallel sides, and any $m>0$, there is an $m$-fold covering of the plane with homothetic copies of $S$ that cannot be decomposed into two…

We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…

The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…

Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

In this paper we study some relationships between polyhedral convex sets (PCS) and generalized polyhedral convex sets (GPCS). In particular, we clarify by a counterexample that the necessary and sufficient conditions for the separation of a…

We systematically study the design of simple patchy sphere models that reversibly self-assemble into monodisperse icosahedral clusters. We find that the optimal patch width is a compromise between structural specificity (the patches must be…

We prepare packings of frictional tetrahedra with volume fractions {\phi} ranging from 0.469 to 0.622 using three different experimental protocols under isobaric conditions. Analysis via X-ray micro-tomography reveals that the contact…

We prove that the moduli space of mean convex two-spheres embedded in complete, orientable 3-dimensional Riemannian manifolds with nonnegative Ricci curvature is path-connected. This result is sharp in the sense that neither of the…

In this article, we construct integrally closed modules of rank two over a two-dimensional regular local ring. The modules are explicitly constructed from a given complete monomial ideal with respect to a regular system of parameters. Then…

We provide a number of new construction techniques for cubical complexes and cubical polytopes, and thus for cubifications (hexahedral mesh generation). As an application we obtain an instance of a cubical 4-polytope that has a…

We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Durer's unfoldability problem, which answers a question…

Let S be a compact surface of genus >1, and g be a metric on S of constant curvature K\in\{-1,0,1\} with conical singularities of negative singular curvature. When K=1 we add the condition that the lengths of the contractible geodesics are…

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.

We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

Can folding a piece of paper flat make it larger? We explore whether a shape $S$ must be scaled to cover a flat-folded copy of itself. We consider both single folds and arbitrary folds (continuous piecewise isometries $S\rightarrow R^2$).…