Related papers: Approximately angle preserving mappings

We construct measure-preserving mappings from the $d$-dimensional unit cube to the $d$-dimensional unit ball and the compact rank one symmetric spaces, namely the $d$-dimensional sphere, the real, complex, and quaternionic projective…

Many computational algorithms applied to geometry operate on discrete representations of shape. It is sometimes necessary to first simplify, or coarsen, representations found in modern datasets for practicable or expedited processing. The…

The aim of this paper is to show that, for any $p \in [1,\infty)$, the $W^{1,p}$-anisotropic interpolation error estimate holds on quadrilateral isoparametric elements verifying the maximum angle condition ($MAC$) and the property of…

The eccentricity matrix $\varepsilon(G)$ of a graph $G$ is constructed from the distance matrix of $G$ by keeping only the largest distances for each row and each column. This matrix can be interpreted as the opposite of the adjacency…

In this paper we consider the problem of efficiently computing $\epsilon$-sketches for the Laplacian and its pseudoinverse. Given a Laplacian and an error tolerance $\epsilon$, we seek to construct a function $f$ such that for any vector…

We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embeddings and is interesting by its own flavor from the line of…

Mappings of a finite set into itself with restriction on the cycle lengths are considered (the so-called A-mappings). Asymptotics is given for the number of these mappings with a power-law reduction of the remainder.

Let $\{(X_i,Y_i)\}_{i\in \{1,..., n\}}$ be an i.i.d. sample from the random design regression model $Y=f(X)+\epsilon$ with $(X,Y)\in [0,1]\times [-M,M]$. In dealing with such a model, adaptation is naturally to be intended in terms of…

We show that a planar bi-Lipschitz orientation-preserving homeomorphism can be approximated in the $W^{1,p}$ norm, together with its inverse, with an orientation-preserving homeomorphism which is piecewise affine or smooth.

What does it mean to be flat? We propose to define it by measuring the maximal variation around a point, or from a dual perspective, the distance to neighboring level sets. After developing some calculus rules, we show how flat minima,…

Let S^n be the standard n-sphere embedded in R^{n+1}. A mapping T: S^n \to S^n, not assumed continuous or even measurable, nor injective, is called weakly circle-preserving if the image of any circle under T is contained in some circle in…

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

Cartoon-like images, i.e., C^2 functions which are smooth apart from a C^2 discontinuity curve, have by now become a standard model for measuring sparse (non-linear) approximation properties of directional representation systems. It was…

We present a massively parallel algorithm, with near-linear memory per machine, that computes a $(2+\varepsilon)$-approximation of minimum-weight vertex cover in $O(\log\log d)$ rounds, where $d$ is the average degree of the input graph.…

This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…

In this paper, we introduce a class of vanishing Carleson measures with conformal invariance and corresponding strongly vanishing symmetric homeomorphisms on the real line and prove that they can be mutually generated under quasiconformal…

Suppose that we are given an arbitrary graph $G=(V, E)$ and know that each edge in $E$ is going to be realized independently with some probability $p$. The goal in the stochastic matching problem is to pick a sparse subgraph $Q$ of $G$ such…

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

We shall generalize the concept of $z=(1-t)x\oplus ty$ to $n$ times which contains to verifying some their properties and inequalities in CAT(0) spaces. In the sequel with introducing of $\alpha$-nonexpansive mappings, we obtain some fixed…

We consider column-sparse covering integer programs, a generalization of set cover, which have a long line of research of (randomized) approximation algorithms. We develop a new rounding scheme based on the Partial Resampling variant of the…