Abstract: By employing the topological adjacent relations among triangles, the highest resolution triangle mesh is parted into a set of generalized triangle strips in which the dual graph of every strip is the Hamiltonian path or cycle. The multiresolution representation of the triangle mesh is constructed successively by simplifying the generalized triangle strips while preserving the properties of the Hamiltonian triangulation. The single and multi resolution representations have same codec strategies in this method. The code rate is proportional to c directly when a triangle mesh is represented in c of resolutions.

Key words: mltiresolution representation, Hamiltonian triangulation, triangle mesh, computational geometry