Related papers: Morse-Smale complexes on convex polyhedra
It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…
Swept volume computation, the determination of regions occupied by moving objects, is essential in graphics, robotics, and manufacturing. Existing approaches either explicitly track surfaces, suffering from robustness issues under complex…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
In this paper we prove a series of Rogers-Shephard type inequalities for convex bodies when dealing with measures on the Euclidean space with either radially decreasing densities, or quasi-concave densities attaining their maximum at the…
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for…
The aim of the paper is to give an `elementary' introduction to the theory of modules over operads and discuss three prominent examples of these objects - simplex, associahedron (= the Stasheff polyhedron) and cyclohedron (= the…
In this work, we investigate the problem of learning distance functions within the query-based learning framework, where a learner is able to pose triplet queries of the form: ``Is $x_i$ closer to $x_j$ or $x_k$?'' We establish formal…
In studies of smooth maps with good differential topological conditions such as immersions, embeddings, Morse functions and their higher dimensional versions including fold maps and application to geometry, especially algebraic and…
We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…
Generalizing tensor-product splines to smooth functions whose control nets outline topological polyhedra, bi-cubic polyhedral splines form a piecewise polynomial, first-order differentiable space that associates one function with each…
In 1967, Chillingworth proved that all convex simplicial 3-balls are collapsible. Using the classical notion of tightness, we generalize this to arbitrary manifolds: We show that all tight simplicial 3-manifolds admit some perfect discrete…
We present a versatile formulation of the convolution operation that we term a "mapped convolution." The standard convolution operation implicitly samples the pixel grid and computes a weighted sum. Our mapped convolution decouples these…
When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires the validation of…
Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
We introduce a distance function between simplicial complexes and study several of its properties.
This paper deals with the regularization of the sum of functions defined on a locally convex spaces through their closed-convex hulls in the bidual space. Different conditions guaranteeing that the closed-convex hull of the sum is the sum…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
This paper is aimed at presenting a systematic survey of the existing now different formulations for the problem of projection of the origin of the Euclidean space onto the convex polyhedron (PPOCP). In the present paper, there are…
We study the isoperimetric problem for the radially symmetric measures. Applying the spherical symmetrization procedure and variational arguments we reduce this problem to a one-dimensional ODE of the second order. Solving numerically this…