Related papers: The inverse moment problem for convex polytopes
We consider the problem of reconstructing the features of a weak anisotropic background potential by the trajectories of vortex dipoles in a nonlinear Gross-Pitaevskii equation. At leading order, the dynamics of vortex dipoles are given by…
We propose a new method for obtaining Poincare-type inequalities on arbitrary convex bodies in R^n. Our technique involves a dual version of Bochner's formula and a certain moment map, and it also applies to some non-convex sets. In…
Reconstructing a radial (1D) quantum potential, V(r), from a few bound-state energies is a long-standing inverse problem because limited spectral data must constrain an entire potential. We present a Laplace-moment reconstruction pipeline…
We answer a problem posed by Panov, which is to describe the relationship between the wedge summands in a homotopy decomposition of the moment-angle complex corresponding to a disjoint union of k points and the connected sum factors in a…
Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…
When comparing 2D shapes, a key issue is their normalization. Translation and scale are easily taken care of by removing the mean and normalizing the energy. However, defining and computing the orientation of a 2D shape is not so simple. In…
In this paper, we introduce new generalized barycentric coordinates (coined as {\em moment coordinates}) on nonconvex quadrilaterals and convex hexahedra with planar faces. This work draws on recent advances in constructing interpolants to…
Eigensolvers involving complex moments can determine all the eigenvalues in a given region in the complex plane and the corresponding eigenvectors of a regular linear matrix pencil. The complex moment acts as a filter for extracting…
This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
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…
This paper considers the approximate reconstruction of points, x \in R^D, which are close to a given compact d-dimensional submanifold, M, of R^D using a small number of linear measurements of x. In particular, it is shown that a number of…
Approximation problems involving a single convex body in $d$-dimensional space have received a great deal of attention in the computational geometry community. In contrast, works involving multiple convex bodies are generally limited to…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
In this paper, we present a novel method to compute an explicit formula for the inverse of the confluent Vandermonde matrices. Our proposed results may have many interesting perspectives in diverse areas of mathematics and natural sciences,…
Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and…
A set of orthonormal polynomials is proposed for image reconstruction from projection data. The relationship between the projection moments and image moments is discussed in detail, and some interesting properties are demonstrated.…
Over the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by…