Computing Teichmüller maps between polygons

DOI10.1007/s10208-015-9294-4zbMath1375.30008arXiv1401.6395OpenAlexW1967822810MaRDI QIDQ2397748

Yanyan Li

Publication date: 23 May 2017

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

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

zbMATH Keywords

approximation algorithmTeichmüller mappolygonssurface registrationinfinitesimally extremal

Mathematics Subject Classification ID

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

Uses Software

• Schwarz-Christoffel
• SC Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of surface registrations using Beltrami holomorphic flow
• A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings
• Teichmuller Mapping (T-Map) and Its Applications to Landmark Matching Registration
• On Numerical Algorithms for the Solution of a Beltrami Equation
• Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation
• Schwarz-Christoffel Mapping
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Convergence of an iterative algorithm for Teichmüller maps via harmonic energy optimization
• Conformal mapping in linear time

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