An Effective Packetization Scheme for Transmission of Progressive 3D Mesh over Unreliable Networks

In this packetization scheme,we firstly construct a non-redundant directed acyclic graph （DAG） encoding the dependencies among the entire vertex split operations of the progressive mesh.Based on this scheme,a global graph equal partition algorithm is presented for partitioning the dependency graph with special loca-l circular features into several equal size sub-graphs,which is packed as packets.Briefly, the global partition algorithm consists of two main phases including initial partition phase and global refinement phase. Experimental results demonstrate that the proposed schemes can minimize the dependencies of the packets while transmitting the progressive mesh over unreliable network,thus decrease the total delay time of unpacking the packets and rendering at client caused by the packets losing,and maximize the rendering nodes so as to achieve better progressive rendering quality.