Abstract: By the Riemann-mapping theorem, one can bijectively map the interior of an -gon to that of another -gon conformally. However, (the boundary extension of) this mapping need not necessarily map the vertices of to those . 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 . 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 of the dilatation of the extremal map, our method uses 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.
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
Cites work
- scientific article; zbMATH DE number 3223850 (Why is no real title available?)
- scientific article; zbMATH DE number 3097092 (Why is no real title available?)
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings
- Conformal mapping in linear time
- Convergence of an iterative algorithm for Teichmüller maps via harmonic energy optimization
- Handbook of applied optimization
- Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation
- On Numerical Algorithms for the Solution of a Beltrami Equation
- Optimization of surface registrations using Beltrami holomorphic flow
- Schwarz-Christoffel Mapping
- Teichmüller mapping (T-map) and its applications to landmark matching registration
Cited in
(4)
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)
