Related papers: Rectifiable curves in proximally smooth sets
On a smooth connected manifold, we consider all possible locally elliptic and locally bounded measurable coefficient Riemannian metrics called rough Riemannian metrics. We equip this set with an extended metric which is connected if and…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
According to the von Neumann-Halperin and Lapidus theorems, in a Hilbert space the iterates of products or, respectively, of convex combinations of orthoprojections are strongly convergent. We extend these results to the iterates of convex…
Reconstructing a finite set of curves from an unordered set of sample points is a well studied topic. There has been less effort that considers how much better the reconstruction can be if tangential information is given as well. We show…
We show that any Lipschitz projection-valued function p on a connected closed Riemannian manifold can be approximated uniformly by smooth projection-valued functions q with Lipschitz constant close to that of p. This answers a question of…
Solving the inverse kinematics problem is a fundamental challenge in motion planning, control, and calibration for articulated robots. Kinematic models for these robots are typically parametrized by joint angles, generating a complicated…
Our main interest in this paper is to study some approximation problems for classes of functions with mixed smoothness. We use technique, based on a combination of results from hyperbolic cross approximation, which were obtained in 1980s --…
In this paper we introduce the notion of rational Hausdorff divisor, we analyze the dimension and irreducibility of its associated linear system of curves, and we prove that all irreducible real curves belonging to the linear system are…
The problem of minimizing the sum of nonsmooth, convex objective functions defined on a real Hilbert space over the intersection of fixed point sets of nonexpansive mappings, onto which the projections cannot be efficiently computed, is…
Data-sensitive metrics adapt distances locally based the density of data points with the goal of aligning distances and some notion of similarity. In this paper, we give the first exact algorithm for computing a data-sensitive metric called…
This paper proposes a simple technique of curve and surface construction with B-splines. Given a control polygon or a control mesh together with node ordinates corresponding to all control points, a rational curve or surface is obtained by…
A method for detecting and approximating fault lines or surfaces, respectively, or decision curves in two and three dimensions with guaranteed accuracy is presented. Reformulated as a classification problem, our method starts from a set of…
We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…
The similarity of two polygonal curves can be measured using the Fr\'echet distance. We introduce the notion of a more robust Fr\'echet distance, where one is allowed to shortcut between vertices of one of the curves. This is a natural…
We provide sufficient conditions for quantitative convergence of the iterates of proximal splitting algorithms for minimizing a sum of functions on a metric space. The theory does not assume that the functions have common minima, nor does…
In this paper we study greedy approximation in Banach spaces. We discuss a modification of the Weak Chebyshev Greedy Algorithm, in which steps of the algorithm can be executed imprecisely. Such inaccuracies are represented by both absolute…
Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they…
In the usual trace reconstruction problem, the goal is to exactly reconstruct an unknown string of length $n$ after it passes through a deletion channel many times independently, producing a set of traces (i.e., random subsequences of the…
Computing the Fr\'echet distance between two polygonal curves takes roughly quadratic time. In this paper, we show that for a special class of curves the Fr\'echet distance computations become easier. Let $P$ and $Q$ be two polygonal curves…
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…