Registration, which aims to find an optimal 1-1 correspondence between shapes, is an important process in different research areas. Conformal mappings have been widely used to obtain a diffeomorphism between shapes that minimizes angular distortion. Conformal registrations are beneficial since it preserves the local geometry well. However, when landmark constraints are enforced, conformal mappings generally do not exist. This motivates us to look for a unique landmark matching quasi-conformal registration, which minimizes the conformality distortion. Under suitable condition on the landmark constraints, a unique diffeomporphism, called the Teichmller extremal mapping between two surfaces can be obtained, which minimizes the maximal conformality distortion. In this paper, we propose an efficient iterative algorithm, called the Quasi-conformal (QC) iterations, to compute the Teichmller mapping. The basic idea is to represent the set of diffeomorphisms using Beltrami coefficients (BCs), and look for an optimal BC associated to the desired Teichmller mapping. The associated diffeomorphism can be efficiently reconstructed from the optimal BC using the Linear Beltrami Solver (LBS). Using BCs to represent diffeomorphisms guarantees the diffeomorphic property of the registration. Using our proposed method, the Teichmller mapping can be accurately and efficiently computed within 10 seconds. The obtained registration is guaranteed to be bijective. The proposed algorithm can also be extended to compute Teichmller mapping with soft landmark constraints. We applied the proposed algorithm to real applications, such as brain

Given a loop on a surface, its homotopy class can be specified as a word consisting of letters representing the homotopy group generators. One of the interesting problems is how to compute the shortest word for a given loop. This is an NP-hard problem in general. However, for a closed surface that allows a hyperbolic metric and is equipped with a canonical set of fundamental group generators, the shortest word problem can be reduced to finding the shortest loop that is homotopic to the given loop, which can be solved efficiently. In this paper, we propose an efficient algorithm to compute the shortest words for loops given on triangulated surface meshes. The design of this algorithm is inspired and guided by the work of Dehn and BirmanSeries. In support of the shortest word algorithm, we also propose efficient algorithms to compute shortest paths and shortest loops under hyperbolic metrics using a novel

We study the spherical cone metrics on surfaces from the point of view of inner angles. A rigidity result is obtained. The existence of spherical cone metric of Delaunay type is also established.

The goal of this chapter is an attempt to relate some ideas of Grothendieck in his Esquisse dun programme [10] and some of the recent results on 2-dimensional topology and geometry. Especially, we shall discuss Teichmller theory, the mapping class groups, the SL (2, C) representation variety of surface groups, and Thurstons theory of measured laminations.

We discuss some applications of an intrinsic multipication in the space of simple loops in a surface.