A New Algorithm for Geometric Data Compression
Zhou Pei · Computer Engineering and Science · 2001
This paper presents a new algorithm for geometric data compression.The method is,under the condition that the mesh boundary of an object is known,to first find the concave point on the boundary, to establish the special tree structure of the mesh nodes(i.e.the transverse section tree),to represent the relation between the mesh nodes inside the adjacent vertices in the transverse section tree as a link list(triangle strip),and to encode, store and transfer the connective relation of the mesh nodes according to its tree structure and link list(triangle strip).This algorithm is different from Gabriel Taubin's algorithm.It is lossless compression for the vertex coordinate,property coordinates and connective relation of the triangle,etc.