A Cell Loading Algorithm for Realtime Navigation in the Web-Based Virtual Space


The KIPS Transactions:PartB , Vol. 11, No. 3, pp. 337-344, Jun. 2004
10.3745/KIPSTB.2004.11.3.337,   PDF Download:

Abstract

Most of the virtual space constructed sufficiently realistic need a lot of memory space to navigate smoothly. And this kind of virtual space also requires real-time responsibility for the navigation as well as realism. In the off-line virtual system, real-time responsibilitycan be resolved by using large scale of secondary memory. In the web-based on-line virtual system, on the other hand, real-time responsibility is highly related to the latency time of network data communication. This induces the necessity of the algorithm for fast data loading. In this paper, we propose and verify the validity of the two methodology for cell loading algorithm. According to the results of computer simulation, the algorithm using hexagonal type cell promotes the real-time responsibility over 30% than that of the rectangular type.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. D. Lee and J. H. Ha, "A Cell Loading Algorithm for Realtime Navigation in the Web-Based Virtual Space," The KIPS Transactions:PartB , vol. 11, no. 3, pp. 337-344, 2004. DOI: 10.3745/KIPSTB.2004.11.3.337.

[ACM Style]
Ki Dong Lee and Ju Han Ha. 2004. A Cell Loading Algorithm for Realtime Navigation in the Web-Based Virtual Space. The KIPS Transactions:PartB , 11, 3, (2004), 337-344. DOI: 10.3745/KIPSTB.2004.11.3.337.