Please use this identifier to cite or link to this item:
|Title:||Packetization of 3D progressive meshes for streaming over lossy networks|
|Citation:||Gu, Y.,Ooi, W.T. (2005). Packetization of 3D progressive meshes for streaming over lossy networks. Proceedings - International Conference on Computer Communications and Networks, ICCCN 2005 : 415-420. ScholarBank@NUS Repository.|
|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.|
|Source Title:||Proceedings - International Conference on Computer Communications and Networks, ICCCN|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.