We introduce a combinatorial curvature flow for piecewise constant curvature metrics on compact triangulated 3-manifolds with boundary consisting of surfaces of negative Euler characteristic. The flow tends to find the complete hyperbolic metric with totally geodesic boundary on a manifold. Some of the basic properties of the combinatorial flow are established. The most important one is that the evolution of the combinatorial curvature satisfies a combinatorial heat equation. It implies that the total curvature decreases along the flow. The local convergence of the flow to the hyperbolic metric is also established if the triangulation is isotopic to a totally geodesic triangulation.
Let M be the interior of a compact 3-manifold with boundary, and let M be an ideal triangulation of M This paper describes necessary and sufficient conditions for the existence of angle structures, semi-angle structures and generalised angle structures on M respectively in terms of a generalised Euler characteristic function on the solution space of the normal surface theory of M This extends previous work of Kang and Rubinstein, and is itself generalised to a more general setting for 3-dimensional pseudo-manifolds.
We show that the hyperbolic structure on a closed, orientable, hyperbolic 3-manifold can be constructed from a solution to the hyperbolic gluing equations using any triangulation with essential edges. The key ingredients in the proof are Thurston's spinning construction and a volume rigidity result attributed by Dunfield to Thurston, Gromov and Goldman. As an application, we show that this gives a new algorithm to detect hyperbolic structures and small Seifert fibred structures on closed 3-manifolds.
Given a compact orientable surface with finitely many punctures \Sigma , let $\Cal S (\Sigma) $ be the set of isotopy classes of essential unoriented simple closed curves in \Sigma . We determine a complete set of relations for a function from $\Cal S (\Sigma) $ to $\bold R $ to be the geodesic length function of a hyperbolic metric with geodesic boundary and cusp ends on \Sigma . As a conse quence, the Teichmller space of hyperbolic metrics with geodesic boundary and cusp ends on \Sigma is reconstructed from an intrinsic $(\bold QP^ 1, PSL (2,\bold Z)) $ structure on $\Cal S (\Sigma) $.
The Gauss-Bonnet theorem and the Cohn-Vossen inequality show that the only complete surface with positive curvature is either the sphere, RP2, or the plane. In higher dimension, the curvature tensor is far more complicated. There are several commonly used partial components of the curvature tensor that had been studied for the whole century. The simplest one is the scalar curvature which is the average of all curvatures at one point. It appeared in the Hilbert action for general relativity. This was studied extensively in connection with general relativity.
Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichm ller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal Teichm ller map between Riemann surfaces of finite type are theoretically guaranteed . Recently, a simple iterative algorithm for computing the Teichm ller maps between connected Riemann surfaces with given boundary value was proposed in . Numerical results was reported in the paper to show the effectiveness of the algorithm. The method was successfully applied to landmark-matching registration. The purpose of this paper is to prove the iterative algorithm proposed in  indeed converges.
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