By Topic

Optimized neighbour prefetch and cache for client-server based walkthrough

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhi Zheng ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore ; Chan, T.K.Y.

We present a position-based neighbour prefetch algorithm for client-server based walkthrough. This algorithm predicts which neighbouring viewcell will be needed in the near future according to the current view position of the client and prefetches the pre-computed potential visible set (PVS) for that viewcell to the client-side cache. Our algorithm has a low memory requirement for the client-side cache. With the same cache size, our algorithm offers a much better performance than the simple neighbour prefetch method. We also provide a delta-transmission algorithm to optimize the prefetch transmission procedure by avoiding transmitting those geometries that are already in the client-side cache. A cache management and entry replacement strategy is also proposed to maintain the client-side cache.

Published in:

Cyberworlds, 2003. Proceedings. 2003 International Conference on

Date of Conference:

3-5 Dec. 2003