Network-driven dynamic scheduling algorithm for large-scale 3D scene

In order to solve the contradiction between the mass data transmission of large-scale scene and the limited network bandwidth, an improved algorithm, network- driven dynamic scheduling algorithm for large-scale 3D scene, is presented in this paper. The scene is cut into blocks and the data is compressed stored after being coded in the server, and transmit request data blocks to the client based on the rendering requirement. As welL the client will real-time load and unload the blocks to meet the demand of real-time rendering. In this way, we can guarantee the amount the data in client´s memory within a certain range to improve the speed of transmission and rendering and achieve real- time interactive rendering.