Packetization of 3D progressive meshes for streaming over lossy networks

Abstract

In this paper, we consider the problem of packetizing progressive 3D geometry models for streaming over a lossy network. We adopt a graph-theoretic approach to model packetization of progressive 3D models, with the goal of minimizing dependencies among packets. We show that this packetization problem is strongly NP-complete, and we propose two packing heuristics. Our experiments show that both heuristics perform better than the naive method. In particular, the greedy packing heuristic produces significant improvement in the number of rendered nodes when the network is lossy. © 2005 IEEE.