Related papers: Balancing polyhedra

In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…

Let M be a (possibly non-orientable) compact 3-manifold with (possibly empty) boundary consisting of tori and Klein bottles. Let $X\subset\partial M$ be a trivalent graph such that $\partial M\setminus X$ is a union of one disc for each…

Let $K$ be a convex polyhedron and $\mathscr F$ its Wulff energy, and let $\mathscr C(K)$ denote the set of convex polyhedra close to $K$ whose faces are parallel to those of $K$. We show that, for sufficiently small $\epsilon$, all…

Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…

We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…

The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M_C of Morse-Smale functions on S^2.…

Let $P \subset \R^3$ be a polyhedron. It was conjectured that if $P$ is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. $P$ can be triangulated without adding new vertices), then it…

We show that the simple modules of the Rouquier blocks of symmetric groups, in characteristic $p$ and having $p$-weight $w$ with $w < p$, have a common complexity $w$, and that when $p$ is odd, $D^{(p+1,1^{p-1})}$ has complexity 1, while…

The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…

We show that within any strong orbit equivalent class, there exist minimal subshifts with arbitrarily low superlinear complexity. This is done by proving that for any simple dimension group with unit $(G,G^+,u)$ and any sequence of positive…

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

We introduce the set of framed convex polyhedra with N faces as the symplectic quotient C^2N//SU(2). A framed polyhedron is then parametrized by N spinors living in C^2 satisfying suitable closure constraints and defines a usual convex…

In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…

I present a coordinate-free, symbolic framework for determining whether a given set of polygonal faces can form a closed, genus-zero polyhedral surface and for predicting admissible internal tetrahedral decompositions consistent with…

We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have…

Collision detection is a critical functionality for robotics. The degree to which objects collide cannot be represented as a continuously differentiable function for any shapes other than spheres. This paper proposes a framework for…

Let $D$ be an orientation of a simple graph. Given $u,v\in V(D)$, a directed shortest $(u,v)$-path is a $(u,v)$-geodesic. $S \subseteq V(D)$ is convex if, for every $u,v \in S$, the vertices in each $(u,v)$-geodesic and in each…

Let P and Q be convex polyhedra in E3 with face lattices F(P) and F(Q) and symmetry groups G(P) and G(Q), respectively. Then, P and Q are called face equivalent if there is a lattice isomorphism between F(P) and F(Q); P and Q are called…

Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component…

This note introduces the class of basic $r$-ball polyhedra in the $d$-dimensional Euclidean space $\mathbb{E}^{d}$ for $d>1$ and $r>0$. We investigate their face structure and, for given integers $0\leq i\leq d-1$, $n\geq d+1\geq 3$…