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

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

WE CONSIDER Haken manifolds M. That is three manifolds which are compact, irreducible, orientable, and sufficiently 1arge. S 8M may or may not be empty. This class of 3-manifolds shares many properties with closed surfaces (# S2 or RP2). On an algebraic level, both are examples of K (T, 1)s. More geometrically the hierarchy structure of a Haken manifold [9] is analogous to a sequence of cuts turning a surface into a disk. With the aid of minimal surfaces we are able to find a sufficiently natural hierarchy to establish a new similarity between Haken manifolds and surfaces. Our main theorem is:

In this paper, we solve a Monge-Ampre-type equation by the continuity method. This equation is motivated by the superstring theory.

NRODUCTION LET y be a rectifiable Jordan curve in three-dimensional euclidean space. Answering an old question, whether y can bound a surface with minimal area, Douglas [l I] and Rad6 [45](independently) found a minimal surface spanning y which is parametrized by the disk. This minimal surface has minimal area among all Lipschitz maps from the disk into R3 which span y. The question whether this solution has branch points or not was finally settled by Osserman [42], who proved that there are no interior true branch points, and by Gulliver [lS], who proved that there are no interior false branch points.