Related papers: An algorithm to reconstruct convex polyhedra from …
We suggest a method of computing volume for a simple polytope $P$ in three-dimensional hyperbolic space $\mathbb{H}^3$. This method combines the combinatorial reduction of $P$ as a trivalent graph $\Gamma$ (the $1$-skeleton of $P$) by…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
We propose a novel method to accurately reconstruct a set of images representing a single scene from few linear multi-view measurements. Each observed image is modeled as the sum of a background image and a foreground one. The background…
We propose strongly consistent algorithms for reconstructing the characteristic function 1_K of an unknown convex body K in R^n from possibly noisy measurements of the modulus of its Fourier transform \hat{1_K}. This represents a complete…
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…
The mixed area of a Reuleaux polygon and its symmetric with respect to the origin is expressed in terms of the mixed area of two explicit polygons. This gives a geometric explanation of a classical proof due to Chakerian. Mixed areas and…
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If…
Jacobson et al. [JKSH13] hypothesized that the local coherency of the generalized winding number function could be used to correctly determine consistent facet orientations in polygon meshes. We report on an approach to consistently…
A convex polyhedron is called monostable if it can rest in stable position only on one of its faces. The aim of this paper is to investigate three questions of Conway, regarding monostable polyhedra, which first appeared in a 1969 paper of…
We show that the Volume Conjecture for polyhedra implies a weak version of the Stoker Conjecture; in turn we prove that this weak version of the Stoker conjecture implies the Stoker conjecture. The main tool used is an extension of a result…
We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
We address the problem of reposing an image of a human into any desired novel pose. This conditional image-generation task requires reasoning about the 3D structure of the human, including self-occluded body parts. Most prior works are…
3D Human Body Reconstruction from a monocular image is an important problem in computer vision with applications in virtual and augmented reality platforms, animation industry, en-commerce domain, etc. While several of the existing works…
We consider a compact hyperbolic antiprism. It is a convex polyhedron with $2n$ vertices in the hyperbolic space $\mathbb{H}^3$. This polyhedron has a symmetry group $S_{2n}$ generated by a mirror-rotational symmetry of order $2n$, i.e.…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
Reconstructing the detailed geometric structure of a face from a given image is a key to many computer vision and graphics applications, such as motion capture and reenactment. The reconstruction task is challenging as human faces vary…
We show that the volume of a convex body in $\mathbb{R}^{n}$ in the general membership oracle model can be computed to within relative error $\varepsilon$ using $\widetilde{O}(n^{3.5}\psi^{2} + n^3/\varepsilon^{2})$ oracle queries, where…
Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a…
Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…