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

Using variational considerations, we establish that there exists a new symmetric trace-free tensor conformal invariant of hypersurfaces embeddings in even dimensional conformal manifolds. This conformal invariant completes the family of…

We investigate shrinking maps from a cusped hyperbolic surface into the moduli space of closed Riemann surfaces. For such a map and its lift to the Teichm\"uller space, we consider whether they are quasi-isometric embeddings with respect to…

We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…

The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains on surfaces. In this paper the conjugate function method, earlier used for simply connected domains, is…

In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. We quantify their rates of convergence and produce different…

There are several Teichm\"uller spaces associated to a surface of infinite topological type, after the choice of a particular basepoint (a complex or a hyperbolic structure on the surface). These spaces include the quasiconformal…

Motivated by the definition of super-Teichm\"uller spaces, and Penner-Zeitlin's recent extension of this definition to decorated super-Teichm\"uller space, as examples of super Riemann surfaces, we use the super Ptolemy relations to obtain…

In this paper, we are interested in the construction of quasiconformal mappings between domains of the Heisenberg group H that minimise a mean distortion functional. We propose to construct such mappings by considering a corresponding…

For a Hamiltonian $K \in C^2(\mathbb{R}^{N \times n})$ and a map $u:\Omega \subseteq \mathbb{R}^n \longrightarrow \mathbb{R}^N$, we consider the supremal functional \[ \label{1} \tag{1} E_\infty (u,\Omega) \ :=\…

The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…

We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…

Classical extremal length (or conformal modulus) is a conformal invariant involving families of paths on the Riemann sphere. In ``Extremal length and functional completion'', Fuglede initiated an abstract theory of extremal length which has…

Over the past several decades, geometric mapping methods have been extensively developed and utilized for many practical problems in science and engineering. To assess the quality of geometric mappings, one common consideration is their…

Adaptive stochastic gradient algorithms in the Euclidean space have attracted much attention lately. Such explorations on Riemannian manifolds, on the other hand, are relatively new, limited, and challenging. This is because of the…

The Dirichlet problem and Dirichlet to Neumann map are analyzed for elliptic equations on a large collection of infinite quantum graphs. For a dense set of continuous functions on the graph boundary, the Dirichlet to Neumann map has values…

Motivated by geometry processing for surfaces with non-trivial topology, we study discrete harmonic maps between closed surfaces of genus at least two. Harmonic maps provide a natural framework for comparing surfaces by minimizing…

Within a framework of noncommutative geometry, we develop an analogue of (pseudo) Riemannian geometry on finite and discrete sets. On a finite set, there is a counterpart of the continuum metric tensor with a simple geometric…

Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…

This paper formulates the problem of Extremum Seeking for optimization of cost functions defined on Riemannian manifolds. We extend the conventional extremum seeking algorithms for optimization problems in Euclidean spaces to optimization…

We present a new family of min-max optimization algorithms that automatically exploit the geometry of the gradient data observed at earlier iterations to perform more informative extra-gradient steps in later ones. Thanks to this adaptation…