Abstract
This paper proposes a novel error resilient packetization scheme for transmitting progressive meshes over lossy networks. In the scheme, we first construct a non-redundant directed acyclic graph encoding the dependencies among the whole vertex splits of the progressive mesh. Then, it is followed by running a global graph equipartition packing algorithm that partitions the dependency graph into several equal size sub-graphs, which is packed as packets. The packing algorithm comprises two main phases: initial partition phase and global refinement phase. Experiment results show that the proposed scheme successfully minimize the dependencies between packets. This reduces the delay for a client to receive a 3D model caused by the packets lost while improving the overall rendering quality.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
