Related papers: Tailoring for Every Body: Reshaping Convex Polyhed…

We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…

We revisit the classical problem of determining the largest copy of a simple polygon $P$ that can be placed into a simple polygon $Q$. Despite significant effort, known algorithms require high polynomial running times. (Barequet and…

A central problem of geometry is the tiling of space with simple structures. The classical solutions, such as triangles, squares, and hexagons in the plane and cubes and other polyhedra in three-dimensional space are built with sharp…

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…

Let u and v be permutations on n letters, with u <= v in Bruhat order. A Bruhat interval polytope Q_{u,v} is the convex hull of all permutation vectors z = (z(1), z(2),...,z(n)) with u <= z <= v. Note that when u=e and v=w_0 are the…

Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a…

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

For a fixed graph H, the H-Recoloring problem asks whether for two given homomorphisms from a graph G to H, we can transform one into the other by changing the image of a single vertex of G in each step and maintaining a homomorphism from G…

A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…

Answering Tarski's plank problem, Bang showed in 1951 that it is impossible to cover a convex body $K \subset \mathbb{R}^d$ with $d \geq 1$ by planks whose total width is less than the minimal width $w(K)$ of $K$. In 2003, A. Bezdek asked…

Let $\mathcal{P}$ be an $n$-dimensional convex polytope and $\mathcal{S}$ be a hypersurface in $\mathbb{R}^n$. This paper investigates potentials to reconstruct $\mathcal{P}$ or at least to compute significant properties of $\mathcal{P}$ if…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…

Tutte's celebrated barycentric embedding theorem describes a natural way to build straight-line embeddings (crossing-free drawings) of a (3-connected) planar graph: map the vertices of the outer face to the vertices of a convex polygon, and…

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…

We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…

A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…

It is challenging to directly estimate the human geometry from a single image due to the high diversity and complexity of body shapes with the various clothing styles. Most of model-based approaches are limited to predict the shape and pose…

Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…

Skeletal polyhedra are discrete structures made up of finite, flat or skew, or infinite, helical or zigzag, polygons as faces, with two faces on each edge and a circular vertex-figure at each vertex. When a variant of Wythoff's construction…