Abstract: A computer system stores and transmits compressed triangular meshes. The computer uses a data structure that represents a triangular mesh in n-dimensional space. The data structure has a table of vertex runs, a table of triangle runs, zero or more marching records, which provide the connectivity information of the triangular mesh. The data structure also has zero or more associated data records that include the geometric information of the triangular mesh. The table of triangle runs and the marching record have information that describes how to construct a triangular mesh (therefore, the polygon vertices and the boundary edges). The table of vertex runs describes a vertex spanning tree that provides additional connectivity information to construct the triangular mesh from the polygon. The associated data record determines the exact position of the triangular mesh in space.

Abstract: A computer system stores and transmits compressed simple triangular meshes. The computer uses a data structure that represents a simple triangular mesh in n-dimensional space. The data structure has a table of vertex runs, a table of triangle runs, zero or more marching records, which provide the connectivity information of the triangular mesh. The data structure also has zero or more associated data records that include the geometric information of the triangular mesh. The table of triangle runs and the marching record have information that describes how to construct a triangular mesh (therefore, the polygon vertices and the boundary edges). The table of vertex runs describes a vertex spanning tree that provides additional connectivity information to construct the triangular mesh from the polygon. The associated data record determines the exact position of the triangular mesh in space.