Related papers: The inverse moment problem for convex polytopes: i…
We introduce an analytic method which stably reconstructs both components of a (sufficiently) smooth, real valued, vector field compactly supported in the plane from knowledge of its Doppler transform and its first moment Doppler transform.…
Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…
Finding a computationally efficient algorithm for the inverse continuous wavelet transform is a fundamental topic in applications. In this paper, we show the convergence of the inverse wavelet transform.
The paper discusses numerical implementations of various inversion schemes for generalized V-line transforms on vector fields introduced in [6]. It demonstrates the possibility of efficient recovery of an unknown vector field from five…
Optimal packing of objects in containers is a critical problem in various real-life and industrial applications. This paper investigates the two-dimensional packing of convex polygons without rotations, where only translations are allowed.…
We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments,…
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…
Herein, we study an inverse problem for detecting unknown obstacles by the enclosure method using the Dirichlet--to--Neumann map for measurements. We justify the method for an penetrable obstacle case involving a biharmonic equation. We use…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
We investigate algorithms for reconstructing a convex body $K$ in $\mathbb {R}^n$ from noisy measurements of its support function or its brightness function in $k$ directions $u_1,...,u_k$. The key idea of these algorithms is to construct a…
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…
In the recent paper arXiv:0710.4085 was shown that any solution of "the polynomial moment problem", which asks to describe polynomials Q orthogonal to all powers of a given polynomial P on a segment, may be obtained as a sum of some…
We consider the problem of inverse kinematics (IK), where one wants to find the parameters of a given kinematic skeleton that best explain a set of observed 3D joint locations. The kinematic skeleton has a tree structure, where each node is…
We consider the problem of Robust PCA in the fully and partially observed settings. Without corruptions, this is the well-known matrix completion problem. From a statistical standpoint this problem has been recently well-studied, and…
We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…
We present in this paper a novel numerical reconstruction method for solving a 3D coefficient inverse problem with scattering data generated by a single direction of the incident plane wave. This inverse problem is well-known to be a highly…
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we…
We analyze the inverse problem of recovering geometric information from the return map induced by a round-trip between a convex core C and an admissible domain. This process defines a discrete dynamical system on the boundary of C governed…
In multi-objective optimization, computing the entire non-dominated set (also known as the Pareto front or the Pareto frontier) is often intractable. However, for any multiplicative factor greater than one, an approximation set can be…