Computing Teichmüller maps between polygons

DOI10.1007/S10208-015-9294-4zbMATH Open1375.30008arXiv1401.6395OpenAlexW1967822810MaRDI QIDQ2397748FDOQ2397748

Yanyan Li

Publication date: 23 May 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Abstract: By the Riemann-mapping theorem, one can bijectively map the interior of an $n$-gon $P$ to that of another $n$-gon $Q$ conformally. However, (the boundary extension of) this mapping need not necessarily map the vertices of $P$ to those $Q$. In this case, one wants to find the ``best" mapping between these polygons, i.e., one that minimizes the maximum angle distortion (the dilatation) over extit{all} points in $P$. From complex analysis such maps are known to exist and are unique. They are called extremal quasiconformal maps, or Teichm"{u}ller maps. Although there are many efficient ways to compute or approximate conformal maps, there is currently no such algorithm for extremal quasiconformal maps. This paper studies the problem of computing extremal quasiconformal maps both in the continuous and discrete settings. We provide the first constructive method to obtain the extremal quasiconformal map in the continuous setting. Our construction is via an iterative procedure that is proven to converge quickly to the unique extremal map. To get to within $epsilon$ of the dilatation of the extremal map, our method uses $O(1/epsilo{n}^4)$ iterations. Every step of the iteration involves convex optimization and solving differential equations, and guarantees a decrease in the dilatation. Our method uses a reduction of the polygon mapping problem to that of the punctured sphere problem, thus solving a more general problem. We also discretize our procedure. We provide evidence for the fact that the discrete procedure closely follows the continuous construction and is therefore expected to converge quickly to a good approximation of the extremal quasiconformal map.

Full work available at URL: https://arxiv.org/abs/1401.6395

Recommendations

• Computing Teichmüller maps between polygons
• Computing the Teichmüller polynomial
• Computing Fenchel-Nielsen coordinates in Teichmüller shape space
• A parametrisation of Teichmüller space by polygons
• Planar morphometrics using Teichmüller maps
• An algorithm to compute the Teichmüller polynomial from matrices
• Computing Triangulations of Mapping Tori of Surface Homeomorphisms
• scientific article; zbMATH DE number 929601
• Mappings to polygonal domains
• Teichmüller geodesies, Delaunay triangulations, and Veech groups

zbMATH Keywords

approximation algorithmpolygonssurface registrationinfinitesimally extremalTeichmüller map

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Teichmüller theory for Riemann surfaces (30F60) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Schwarz-Christoffel-type mappings (30C30)

Cites Work

• Title not available (Why is that?)
• Handbook of applied optimization
• Schwarz-Christoffel Mapping
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Teichmüller mapping (T-map) and its applications to landmark matching registration
• Optimization of surface registrations using Beltrami holomorphic flow
• A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings
• On Numerical Algorithms for the Solution of a Beltrami Equation
• Conformal mapping in linear time
• Convergence of an iterative algorithm for Teichmüller maps via harmonic energy optimization
• Title not available (Why is that?)
• Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation

Cited In (2)

• Computing the Teichmüller polynomial
• Planar morphometrics using Teichmüller maps

Uses Software

• Schwarz-Christoffel
• SC Toolbox

This page was built for publication: Computing Teichmüller maps between polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397748)