Geometric compression for fast transmission

Abstract

A compact representation of a two dimensional mesh can significantly reduce transmission of mesh data over the Internet. Compact representation of the mesh is also desirable for saving storage space. The compressibility of a mesh can be elegantly captured in term of Hamiltonian graphs. In this paper we present an algorithm to partition a convex polygon into a triangular mesh that admits Hamiltonian paths.