GENERATING COMPRESSIBLE TRIANGULAR MESH

摘要

Compressible meshes are highly desired in application areas such as, interactive visualization, image rendering, and transmission of mesh data across the Internet. We present a critical review of recently reported algorithms dealing with the geometric compression of triangular mesh. We propose an algorithm based on the strip/core decomposition of polygons that yield compressible triangular mesh containing high proportion of quality triangles. We report an implementation of the spiral decomposition algorithm. The experimental results show that the proposed algorithm produces high quality mesh admitting significant compression.