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

We introduce a semi-algebraic structure on the set of all isotopy classes of non-separating simple closed curves in any compact oriented surface and show that the structure is finitely generated. As a consequence, we produce a natural finite dimensional linear representation of the mapping class group of the surface. Applications to the Teichmller space, Thurston's measured lamination space, the harmonic Beltrami differentials, and the first cohomology groups of the surface are discussed.

We study the rigidity of polyhedral surfaces and the moduli space of polyhedral surfaces using variational principles. Curvature-like quantities for polyhedral surfaces are introduced and are shown to determine the polyhedral metric up to isometry. The action functionals in the variational approaches are derived from the cosine law. They can be considered as 2-dimensional counterparts of the Schlaefli formula.

We propose an approach to find constant curvature metrics on triangulated closed 3-manifolds using a finite dimensional variational method whose energy function is the volume. The concept of an angle structure on a tetrahedron and on a triangulated closed 3-manifold is introduced following the work of Casson, Murakami and Rivin. It is proved by A. Kitaev and the author that any closed 3-manifold has a triangulation supporting an angle structure. The moduli space of all angle structures on a triangulated 3-manifold is a bounded open convex polytope in a Euclidean space. The volume of an angle structure is defined. Both the angle structure and the volume are natural generalizations of tetrahedra in the constant sectional curvature spaces and their volume. It is shown that the volume functional can be extended continuously to the compact closure of the moduli space. In particular, the maximum point of the

The problem is concerned about computing virtual coordinates for greedy routing in a wireless ad hoc network. Consider a set of wireless nodes S densely deployed inside a geometric domain R2. Nodes within communication range can directly communicate with each other. We ask whether one can compute a set of virtual coordinates for S such that greedy routing has guaranteed delivery. In particular, each node forwards the message to the neighbor whose distance to the destination, computed under the virtual coordinates and some metric function d, is the smallest. If such a neighbor can always be found, greedy routing successfully delivers the message to the destination. The problem can be phrased as finding a greedy embedding of S in some geometric space, such that greedy routing always succeeds. In the setting of this entry, we assume that the nodes are a dense sample of the domain such that