Related papers: Computing Teichm\"{u}ller Maps between Polygons

We study constructing an algebraic curve from a Riemann surface given via a translation surface, which is a collection of finitely many polygons in the plane with sides identified by translation. We use the theory of discrete Riemann…

Quaternionic analysis, which describes conformal maps from Riemann surfaces into $\mathbb{R}^3$ or $\mathbb{R}^4$, is extended to weakly conformal maps. As a consequence we present a new proof that on any compact Riemann surface $X$ the…

Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…

We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…

The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…

Quasiconformal maps in the plane are orientation preserving homeomorphisms that satisfy certain distortion inequalities; infinitesimally, they map circles to ellipses of bounded eccentricity. Such maps have many useful geometric distortion…

The construction of optimal non-uniform mappings for discrete input memoryless channels (DIMCs) is investigated. An efficient algorithm to find optimal mappings is proposed and the rate by which a target distribution is approached is…

We extend the classical primal-dual interior point method from the Euclidean setting to the Riemannian one. Our method, named the Riemannian interior point method, is for solving Riemannian constrained optimization problems. We establish…

Maps from a source manifold $ {\mathcal M}$ to a target manifold ${\mathcal N}$ appear in liquid crystals, colour image enhancement, texture mapping, brain mapping, and many other areas. A numerical framework to solve variational problems…

In this paper, we prove a finite dimensional approximation scheme for the Wiener measure on closed Riemannian manifolds, establishing a generalization for $L^{1}$-functionals, of the approach followed by Andersson and Driver on [1]. We…

In this work, we present a novel approach for solving stochastic shape optimization problems. Our method is the extension of the classical stochastic gradient method to infinite-dimensional shape manifolds. We prove convergence of the…

This paper describes an approach for fitting an immersed submanifold of a finite-dimensional Euclidean space to random samples. The reconstruction mapping from the ambient space to the desired submanifold is implemented as a composition of…

Given only a collection of points sampled from a Riemannian manifold embedded in a Euclidean space, in this paper we propose a new method to solve elliptic partial differential equations (PDEs) supplemented with boundary conditions. Notice…

In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each…

The conformal deformations are contained in two classes of mappings: quasiconformal and harmonic mappings. In this paper we consider the intersection of these classes. We show that, every $K$ quasiconformal harmonic mapping between…

This paper develops a theory of Lipschitz comparisons of hyperbolic surfaces analogous to the theory of quasi-conformal comparisons. Extremal Lipschitz maps (minimal stretch maps) and geodesics for the `Lipschitz metric' are constructed.…

Let $T$ be a triangulation of a Riemann surface. We show that the 1-skeleton of $T$ may be oriented so that there is a global bound on the outdegree of the vertices. Our application is to construct extremal metrics on triangulations formed…

A new Hardy space Hardy space approach of Dirichlet type problem based on Tikhonov regularization and Reproducing Hilbert kernel space is discussed in this paper, which turns out to be a typical extremal problem located on the upper…

Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for…

We propose an inexact optimization algorithm on Riemannian manifolds, motivated by quadratic discrimination tasks in high-dimensional, low-sample-size (HDLSS) imaging settings. In such applications, gradient evaluations are often biased due…