相关论文: Unfolding Restricted Convex Caps

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 study the reflectional symmetry of a surface in the Euclidean 3-dimensional space with a cross-cap singularity with respect to planes. This symmetry is picked up by the singularities of folding maps on the cross-cap. We give a list of…

A $3$-Prismatoid is the convex hull of two convex polygons $A$ and $B$ which lie in parallel planes $H_A, H_B\subset\mathbb{R}^3$. Let $A'$ be the orthogonal projection of $A$ onto $H_B$. A prismatoid is called nested if $A'$ is properly…

For a class of competitive maps there is an invariant one-codimensional manifold (the carrying simplex) attracting all non-trivial orbits. In the present paper it is shown that its convexity implies that it is a $C^1$…

It is proved that any smooth manifold $\mathcal M$ of dimension $m$ admits a smooth polynomially convex embedding into $\mathbb C^n$ when $n\geq \lfloor 5m/4\rfloor$. Further, such embeddings are dense in the space of smooth maps from…

Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…

This is a case study of the algebraic boundary of convex hulls of varieties. We focus on surfaces in fourspace to showcase new geometric phenomena that neither curves nor hypersurfaces do. Our method is a detailed analysis of a general…

We consider the class of smooth convex functions defined over an open convex set. We show that this class is essentially different than the class of smooth convex functions defined over the entire linear space by exhibiting a function that…

A polyhedron $\textbf{P} \subset \mathbb{R}^3$ has Rupert's property if a hole can be cut into it, such that a copy of $\textbf{P}$ can pass through this hole. There are several works investigating this property for some specific polyhedra:…

In this paper we focus on the tropical convex hull of convex sets and polyhedral complexes. We give a vertex description of the tropical convex hull of a line segment and a ray. %in \RR^{n+1}/\RR\mathbf{1}. Next we show that tropical convex…

In this Letter we suggest a method of convex rigid frames in the studies of the multipartite quNit pure-states. We illustrate what are the convex rigid frames and what is the method of convex rigid frames. As the applications we use this…

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…

Restrictions are obtained on the topology of a compact divergence-free null hypersurface in a four-dimensional Lorentzian manifold whose Ricci tensor is zero or satisfies some weaker conditions. This is done by showing that each null…

Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…

The problem of classifying high-dimensional shapes in real-world data grows in complexity as the dimension of the space increases. For the case of identifying convex shapes of different geometries, a new classification framework has…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the convex hull…

We address the problem of minimizing a convex smooth function $f(x)$ over a compact polyhedral set $D$ given a stochastic zeroth-order constraint feedback model. This problem arises in safety-critical machine learning applications, such as…